1fa9e4066Sahrens /* 2fa9e4066Sahrens * CDDL HEADER START 3fa9e4066Sahrens * 4fa9e4066Sahrens * The contents of this file are subject to the terms of the 5ea8dc4b6Seschrock * Common Development and Distribution License (the "License"). 6ea8dc4b6Seschrock * 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 /* 22cdb0ab79Smaybee * Copyright 2008 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_tx.h> 33fa9e4066Sahrens #include <sys/dmu_objset.h> 34fa9e4066Sahrens #include <sys/dsl_dataset.h> 35fa9e4066Sahrens #include <sys/spa.h> 36fa9e4066Sahrens 37fa9e4066Sahrens static void 38fa9e4066Sahrens dnode_increase_indirection(dnode_t *dn, dmu_tx_t *tx) 39fa9e4066Sahrens { 40fa9e4066Sahrens dmu_buf_impl_t *db; 41c717a561Smaybee int txgoff = tx->tx_txg & TXG_MASK; 42c717a561Smaybee int nblkptr = dn->dn_phys->dn_nblkptr; 43c717a561Smaybee int old_toplvl = dn->dn_phys->dn_nlevels - 1; 44c717a561Smaybee int new_level = dn->dn_next_nlevels[txgoff]; 45fa9e4066Sahrens int i; 46fa9e4066Sahrens 47c717a561Smaybee rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 48c717a561Smaybee 49c717a561Smaybee /* this dnode can't be paged out because it's dirty */ 50fa9e4066Sahrens ASSERT(dn->dn_phys->dn_type != DMU_OT_NONE); 51fa9e4066Sahrens ASSERT(RW_WRITE_HELD(&dn->dn_struct_rwlock)); 52c717a561Smaybee ASSERT(new_level > 1 && dn->dn_phys->dn_nlevels > 0); 53fa9e4066Sahrens 54fa9e4066Sahrens db = dbuf_hold_level(dn, dn->dn_phys->dn_nlevels, 0, FTAG); 55ea8dc4b6Seschrock ASSERT(db != NULL); 56c717a561Smaybee 57c717a561Smaybee dn->dn_phys->dn_nlevels = new_level; 58f82bfe17Sgw dprintf("os=%p obj=%llu, increase to %d\n", dn->dn_objset, 59f82bfe17Sgw dn->dn_object, dn->dn_phys->dn_nlevels); 60c717a561Smaybee 61c717a561Smaybee /* check for existing blkptrs in the dnode */ 62c717a561Smaybee for (i = 0; i < nblkptr; i++) 63fa9e4066Sahrens if (!BP_IS_HOLE(&dn->dn_phys->dn_blkptr[i])) 64fa9e4066Sahrens break; 65c717a561Smaybee if (i != nblkptr) { 66c717a561Smaybee /* transfer dnode's block pointers to new indirect block */ 67c717a561Smaybee (void) dbuf_read(db, NULL, DB_RF_MUST_SUCCEED|DB_RF_HAVESTRUCT); 68c717a561Smaybee ASSERT(db->db.db_data); 69c717a561Smaybee ASSERT(arc_released(db->db_buf)); 70c717a561Smaybee ASSERT3U(sizeof (blkptr_t) * nblkptr, <=, db->db.db_size); 71fa9e4066Sahrens bcopy(dn->dn_phys->dn_blkptr, db->db.db_data, 72c717a561Smaybee sizeof (blkptr_t) * nblkptr); 736b4acc8bSahrens arc_buf_freeze(db->db_buf); 74fa9e4066Sahrens } 75fa9e4066Sahrens 76fa9e4066Sahrens /* set dbuf's parent pointers to new indirect buf */ 77c717a561Smaybee for (i = 0; i < nblkptr; i++) { 78c717a561Smaybee dmu_buf_impl_t *child = dbuf_find(dn, old_toplvl, i); 79c717a561Smaybee 80fa9e4066Sahrens if (child == NULL) 81fa9e4066Sahrens continue; 82c717a561Smaybee ASSERT3P(child->db_dnode, ==, dn); 83c717a561Smaybee if (child->db_parent && child->db_parent != dn->dn_dbuf) { 84c717a561Smaybee ASSERT(child->db_parent->db_level == db->db_level); 85c717a561Smaybee ASSERT(child->db_blkptr != 86c717a561Smaybee &dn->dn_phys->dn_blkptr[child->db_blkid]); 87fa9e4066Sahrens mutex_exit(&child->db_mtx); 88fa9e4066Sahrens continue; 89fa9e4066Sahrens } 90c717a561Smaybee ASSERT(child->db_parent == NULL || 91c717a561Smaybee child->db_parent == dn->dn_dbuf); 92c717a561Smaybee 93c717a561Smaybee child->db_parent = db; 94c717a561Smaybee dbuf_add_ref(db, child); 95c717a561Smaybee if (db->db.db_data) 96c717a561Smaybee child->db_blkptr = (blkptr_t *)db->db.db_data + i; 97c717a561Smaybee else 98c717a561Smaybee child->db_blkptr = NULL; 99c717a561Smaybee dprintf_dbuf_bp(child, child->db_blkptr, 100c717a561Smaybee "changed db_blkptr to new indirect %s", ""); 101fa9e4066Sahrens 102fa9e4066Sahrens mutex_exit(&child->db_mtx); 103fa9e4066Sahrens } 104fa9e4066Sahrens 105c717a561Smaybee bzero(dn->dn_phys->dn_blkptr, sizeof (blkptr_t) * nblkptr); 106fa9e4066Sahrens 107ea8dc4b6Seschrock dbuf_rele(db, FTAG); 108c717a561Smaybee 109c717a561Smaybee rw_exit(&dn->dn_struct_rwlock); 110fa9e4066Sahrens } 111fa9e4066Sahrens 112cdb0ab79Smaybee static int 113fa9e4066Sahrens free_blocks(dnode_t *dn, blkptr_t *bp, int num, dmu_tx_t *tx) 114fa9e4066Sahrens { 115cdb0ab79Smaybee dsl_dataset_t *ds = dn->dn_objset->os_dsl_dataset; 116fa9e4066Sahrens uint64_t bytesfreed = 0; 117cdb0ab79Smaybee int i, blocks_freed = 0; 118fa9e4066Sahrens 119cdb0ab79Smaybee dprintf("ds=%p obj=%llx num=%d\n", ds, dn->dn_object, num); 120fa9e4066Sahrens 121fa9e4066Sahrens for (i = 0; i < num; i++, bp++) { 122fa9e4066Sahrens if (BP_IS_HOLE(bp)) 123fa9e4066Sahrens continue; 124fa9e4066Sahrens 125cdb0ab79Smaybee bytesfreed += dsl_dataset_block_kill(ds, bp, dn->dn_zio, tx); 12699653d4eSeschrock ASSERT3U(bytesfreed, <=, DN_USED_BYTES(dn->dn_phys)); 127c717a561Smaybee bzero(bp, sizeof (blkptr_t)); 128cdb0ab79Smaybee blocks_freed += 1; 129fa9e4066Sahrens } 130fa9e4066Sahrens dnode_diduse_space(dn, -bytesfreed); 131cdb0ab79Smaybee return (blocks_freed); 132fa9e4066Sahrens } 133fa9e4066Sahrens 1349c9dc39aSek #ifdef ZFS_DEBUG 135fa9e4066Sahrens static void 136fa9e4066Sahrens free_verify(dmu_buf_impl_t *db, uint64_t start, uint64_t end, dmu_tx_t *tx) 137fa9e4066Sahrens { 138fa9e4066Sahrens int off, num; 139fa9e4066Sahrens int i, err, epbs; 140fa9e4066Sahrens uint64_t txg = tx->tx_txg; 141fa9e4066Sahrens 142fa9e4066Sahrens epbs = db->db_dnode->dn_phys->dn_indblkshift - SPA_BLKPTRSHIFT; 143fa9e4066Sahrens off = start - (db->db_blkid * 1<<epbs); 144fa9e4066Sahrens num = end - start + 1; 145fa9e4066Sahrens 146fa9e4066Sahrens ASSERT3U(off, >=, 0); 147fa9e4066Sahrens ASSERT3U(num, >=, 0); 148fa9e4066Sahrens ASSERT3U(db->db_level, >, 0); 149fa9e4066Sahrens ASSERT3U(db->db.db_size, ==, 1<<db->db_dnode->dn_phys->dn_indblkshift); 150fa9e4066Sahrens ASSERT3U(off+num, <=, db->db.db_size >> SPA_BLKPTRSHIFT); 151fa9e4066Sahrens ASSERT(db->db_blkptr != NULL); 152fa9e4066Sahrens 153fa9e4066Sahrens for (i = off; i < off+num; i++) { 154fa9e4066Sahrens uint64_t *buf; 155fa9e4066Sahrens dmu_buf_impl_t *child; 156c717a561Smaybee dbuf_dirty_record_t *dr; 157c717a561Smaybee int j; 158fa9e4066Sahrens 159fa9e4066Sahrens ASSERT(db->db_level == 1); 160fa9e4066Sahrens 161fa9e4066Sahrens rw_enter(&db->db_dnode->dn_struct_rwlock, RW_READER); 162fa9e4066Sahrens err = dbuf_hold_impl(db->db_dnode, db->db_level-1, 163f82bfe17Sgw (db->db_blkid << epbs) + i, TRUE, FTAG, &child); 164fa9e4066Sahrens rw_exit(&db->db_dnode->dn_struct_rwlock); 165fa9e4066Sahrens if (err == ENOENT) 166fa9e4066Sahrens continue; 167fa9e4066Sahrens ASSERT(err == 0); 168fa9e4066Sahrens ASSERT(child->db_level == 0); 169c717a561Smaybee dr = child->db_last_dirty; 170c717a561Smaybee while (dr && dr->dr_txg > txg) 171c717a561Smaybee dr = dr->dr_next; 172c717a561Smaybee ASSERT(dr == NULL || dr->dr_txg == txg); 173c717a561Smaybee 174c717a561Smaybee /* data_old better be zeroed */ 175c717a561Smaybee if (dr) { 176c717a561Smaybee buf = dr->dt.dl.dr_data->b_data; 177fa9e4066Sahrens for (j = 0; j < child->db.db_size >> 3; j++) { 178fa9e4066Sahrens if (buf[j] != 0) { 179fa9e4066Sahrens panic("freed data not zero: " 180fa9e4066Sahrens "child=%p i=%d off=%d num=%d\n", 181*903a11ebSrh (void *)child, i, off, num); 182fa9e4066Sahrens } 183fa9e4066Sahrens } 184fa9e4066Sahrens } 185fa9e4066Sahrens 186fa9e4066Sahrens /* 187fa9e4066Sahrens * db_data better be zeroed unless it's dirty in a 188fa9e4066Sahrens * future txg. 189fa9e4066Sahrens */ 190fa9e4066Sahrens mutex_enter(&child->db_mtx); 191fa9e4066Sahrens buf = child->db.db_data; 192fa9e4066Sahrens if (buf != NULL && child->db_state != DB_FILL && 193c717a561Smaybee child->db_last_dirty == NULL) { 194fa9e4066Sahrens for (j = 0; j < child->db.db_size >> 3; j++) { 195fa9e4066Sahrens if (buf[j] != 0) { 196fa9e4066Sahrens panic("freed data not zero: " 197fa9e4066Sahrens "child=%p i=%d off=%d num=%d\n", 198*903a11ebSrh (void *)child, i, off, num); 199fa9e4066Sahrens } 200fa9e4066Sahrens } 201fa9e4066Sahrens } 202fa9e4066Sahrens mutex_exit(&child->db_mtx); 203fa9e4066Sahrens 204ea8dc4b6Seschrock dbuf_rele(child, FTAG); 205fa9e4066Sahrens } 206fa9e4066Sahrens } 2079c9dc39aSek #endif 208fa9e4066Sahrens 209cdb0ab79Smaybee #define ALL -1 210cdb0ab79Smaybee 211fa9e4066Sahrens static int 212fa9e4066Sahrens free_children(dmu_buf_impl_t *db, uint64_t blkid, uint64_t nblks, int trunc, 213fa9e4066Sahrens dmu_tx_t *tx) 214fa9e4066Sahrens { 215fa9e4066Sahrens dnode_t *dn = db->db_dnode; 216fa9e4066Sahrens blkptr_t *bp; 217fa9e4066Sahrens dmu_buf_impl_t *subdb; 218fa9e4066Sahrens uint64_t start, end, dbstart, dbend, i; 219fa9e4066Sahrens int epbs, shift, err; 220fa9e4066Sahrens int all = TRUE; 221cdb0ab79Smaybee int blocks_freed = 0; 222cdb0ab79Smaybee 223cdb0ab79Smaybee /* 224cdb0ab79Smaybee * There is a small possibility that this block will not be cached: 225cdb0ab79Smaybee * 1 - if level > 1 and there are no children with level <= 1 226cdb0ab79Smaybee * 2 - if we didn't get a dirty hold (because this block had just 227cdb0ab79Smaybee * finished being written -- and so had no holds), and then this 228cdb0ab79Smaybee * block got evicted before we got here. 229cdb0ab79Smaybee */ 230cdb0ab79Smaybee if (db->db_state != DB_CACHED) 231cdb0ab79Smaybee (void) dbuf_read(db, NULL, DB_RF_MUST_SUCCEED); 232fa9e4066Sahrens 233fa9e4066Sahrens arc_release(db->db_buf, db); 234fa9e4066Sahrens bp = (blkptr_t *)db->db.db_data; 235fa9e4066Sahrens 236fa9e4066Sahrens epbs = db->db_dnode->dn_phys->dn_indblkshift - SPA_BLKPTRSHIFT; 237fa9e4066Sahrens shift = (db->db_level - 1) * epbs; 238fa9e4066Sahrens dbstart = db->db_blkid << epbs; 239fa9e4066Sahrens start = blkid >> shift; 240fa9e4066Sahrens if (dbstart < start) { 241fa9e4066Sahrens bp += start - dbstart; 242fa9e4066Sahrens all = FALSE; 243fa9e4066Sahrens } else { 244fa9e4066Sahrens start = dbstart; 245fa9e4066Sahrens } 246fa9e4066Sahrens dbend = ((db->db_blkid + 1) << epbs) - 1; 247fa9e4066Sahrens end = (blkid + nblks - 1) >> shift; 248fa9e4066Sahrens if (dbend <= end) 249fa9e4066Sahrens end = dbend; 250fa9e4066Sahrens else if (all) 251fa9e4066Sahrens all = trunc; 252fa9e4066Sahrens ASSERT3U(start, <=, end); 253fa9e4066Sahrens 254fa9e4066Sahrens if (db->db_level == 1) { 2559c9dc39aSek FREE_VERIFY(db, start, end, tx); 256cdb0ab79Smaybee blocks_freed = free_blocks(dn, bp, end-start+1, tx); 2576b4acc8bSahrens arc_buf_freeze(db->db_buf); 258cdb0ab79Smaybee ASSERT(all || blocks_freed == 0 || db->db_last_dirty); 259cdb0ab79Smaybee return (all ? ALL : blocks_freed); 260fa9e4066Sahrens } 261fa9e4066Sahrens 262fa9e4066Sahrens for (i = start; i <= end; i++, bp++) { 263fa9e4066Sahrens if (BP_IS_HOLE(bp)) 264fa9e4066Sahrens continue; 265fa9e4066Sahrens rw_enter(&dn->dn_struct_rwlock, RW_READER); 266fa9e4066Sahrens err = dbuf_hold_impl(dn, db->db_level-1, i, TRUE, FTAG, &subdb); 267fa9e4066Sahrens ASSERT3U(err, ==, 0); 268fa9e4066Sahrens rw_exit(&dn->dn_struct_rwlock); 269fa9e4066Sahrens 270cdb0ab79Smaybee if (free_children(subdb, blkid, nblks, trunc, tx) == ALL) { 271fa9e4066Sahrens ASSERT3P(subdb->db_blkptr, ==, bp); 272cdb0ab79Smaybee blocks_freed += free_blocks(dn, bp, 1, tx); 27323b11526Smaybee } else { 27423b11526Smaybee all = FALSE; 275fa9e4066Sahrens } 276ea8dc4b6Seschrock dbuf_rele(subdb, FTAG); 277fa9e4066Sahrens } 2786b4acc8bSahrens arc_buf_freeze(db->db_buf); 279fa9e4066Sahrens #ifdef ZFS_DEBUG 280fa9e4066Sahrens bp -= (end-start)+1; 281fa9e4066Sahrens for (i = start; i <= end; i++, bp++) { 282fa9e4066Sahrens if (i == start && blkid != 0) 283fa9e4066Sahrens continue; 284fa9e4066Sahrens else if (i == end && !trunc) 285fa9e4066Sahrens continue; 286fa9e4066Sahrens ASSERT3U(bp->blk_birth, ==, 0); 287fa9e4066Sahrens } 288fa9e4066Sahrens #endif 289cdb0ab79Smaybee ASSERT(all || blocks_freed == 0 || db->db_last_dirty); 290cdb0ab79Smaybee return (all ? ALL : blocks_freed); 291fa9e4066Sahrens } 292fa9e4066Sahrens 293fa9e4066Sahrens /* 294fa9e4066Sahrens * free_range: Traverse the indicated range of the provided file 295fa9e4066Sahrens * and "free" all the blocks contained there. 296fa9e4066Sahrens */ 297fa9e4066Sahrens static void 298fa9e4066Sahrens dnode_sync_free_range(dnode_t *dn, uint64_t blkid, uint64_t nblks, dmu_tx_t *tx) 299fa9e4066Sahrens { 300fa9e4066Sahrens blkptr_t *bp = dn->dn_phys->dn_blkptr; 301fa9e4066Sahrens dmu_buf_impl_t *db; 302fa9e4066Sahrens int trunc, start, end, shift, i, err; 303fa9e4066Sahrens int dnlevel = dn->dn_phys->dn_nlevels; 304fa9e4066Sahrens 305fa9e4066Sahrens if (blkid > dn->dn_phys->dn_maxblkid) 306fa9e4066Sahrens return; 307fa9e4066Sahrens 308fa9e4066Sahrens ASSERT(dn->dn_phys->dn_maxblkid < UINT64_MAX); 309fa9e4066Sahrens trunc = blkid + nblks > dn->dn_phys->dn_maxblkid; 310fa9e4066Sahrens if (trunc) 311fa9e4066Sahrens nblks = dn->dn_phys->dn_maxblkid - blkid + 1; 312fa9e4066Sahrens 313fa9e4066Sahrens /* There are no indirect blocks in the object */ 314fa9e4066Sahrens if (dnlevel == 1) { 315fa9e4066Sahrens if (blkid >= dn->dn_phys->dn_nblkptr) { 316fa9e4066Sahrens /* this range was never made persistent */ 317fa9e4066Sahrens return; 318fa9e4066Sahrens } 319fa9e4066Sahrens ASSERT3U(blkid + nblks, <=, dn->dn_phys->dn_nblkptr); 320cdb0ab79Smaybee (void) free_blocks(dn, bp + blkid, nblks, tx); 321fa9e4066Sahrens if (trunc) { 322fa9e4066Sahrens uint64_t off = (dn->dn_phys->dn_maxblkid + 1) * 323fa9e4066Sahrens (dn->dn_phys->dn_datablkszsec << SPA_MINBLOCKSHIFT); 324fa9e4066Sahrens dn->dn_phys->dn_maxblkid = (blkid ? blkid - 1 : 0); 325fa9e4066Sahrens ASSERT(off < dn->dn_phys->dn_maxblkid || 326fa9e4066Sahrens dn->dn_phys->dn_maxblkid == 0 || 327cdb0ab79Smaybee dnode_next_offset(dn, 0, &off, 1, 1, 0) != 0); 328fa9e4066Sahrens } 329fa9e4066Sahrens return; 330fa9e4066Sahrens } 331fa9e4066Sahrens 332fa9e4066Sahrens shift = (dnlevel - 1) * (dn->dn_phys->dn_indblkshift - SPA_BLKPTRSHIFT); 333fa9e4066Sahrens start = blkid >> shift; 334fa9e4066Sahrens ASSERT(start < dn->dn_phys->dn_nblkptr); 335fa9e4066Sahrens end = (blkid + nblks - 1) >> shift; 336fa9e4066Sahrens bp += start; 337fa9e4066Sahrens for (i = start; i <= end; i++, bp++) { 338fa9e4066Sahrens if (BP_IS_HOLE(bp)) 339fa9e4066Sahrens continue; 340fa9e4066Sahrens rw_enter(&dn->dn_struct_rwlock, RW_READER); 341fa9e4066Sahrens err = dbuf_hold_impl(dn, dnlevel-1, i, TRUE, FTAG, &db); 342fa9e4066Sahrens ASSERT3U(err, ==, 0); 343fa9e4066Sahrens rw_exit(&dn->dn_struct_rwlock); 344fa9e4066Sahrens 345cdb0ab79Smaybee if (free_children(db, blkid, nblks, trunc, tx) == ALL) { 346fa9e4066Sahrens ASSERT3P(db->db_blkptr, ==, bp); 347cdb0ab79Smaybee (void) free_blocks(dn, bp, 1, tx); 348fa9e4066Sahrens } 349ea8dc4b6Seschrock dbuf_rele(db, FTAG); 350fa9e4066Sahrens } 351fa9e4066Sahrens if (trunc) { 352fa9e4066Sahrens uint64_t off = (dn->dn_phys->dn_maxblkid + 1) * 353fa9e4066Sahrens (dn->dn_phys->dn_datablkszsec << SPA_MINBLOCKSHIFT); 354fa9e4066Sahrens dn->dn_phys->dn_maxblkid = (blkid ? blkid - 1 : 0); 355fa9e4066Sahrens ASSERT(off < dn->dn_phys->dn_maxblkid || 356fa9e4066Sahrens dn->dn_phys->dn_maxblkid == 0 || 357cdb0ab79Smaybee dnode_next_offset(dn, 0, &off, 1, 1, 0) != 0); 358fa9e4066Sahrens } 359fa9e4066Sahrens } 360fa9e4066Sahrens 361ea8dc4b6Seschrock /* 362ea8dc4b6Seschrock * Try to kick all the dnodes dbufs out of the cache... 363ea8dc4b6Seschrock */ 3641934e92fSmaybee void 3651934e92fSmaybee dnode_evict_dbufs(dnode_t *dn) 366ea8dc4b6Seschrock { 367c543ec06Sahrens int progress; 368c543ec06Sahrens int pass = 0; 369c543ec06Sahrens 370c543ec06Sahrens do { 371d90a49d6Smaybee dmu_buf_impl_t *db, marker; 372c543ec06Sahrens int evicting = FALSE; 373c543ec06Sahrens 374c543ec06Sahrens progress = FALSE; 375c543ec06Sahrens mutex_enter(&dn->dn_dbufs_mtx); 376d90a49d6Smaybee list_insert_tail(&dn->dn_dbufs, &marker); 377d90a49d6Smaybee db = list_head(&dn->dn_dbufs); 378d90a49d6Smaybee for (; db != ▮ db = list_head(&dn->dn_dbufs)) { 379d90a49d6Smaybee list_remove(&dn->dn_dbufs, db); 380d90a49d6Smaybee list_insert_tail(&dn->dn_dbufs, db); 381f82bfe17Sgw ASSERT3P(db->db_dnode, ==, dn); 382ea8dc4b6Seschrock 383ea8dc4b6Seschrock mutex_enter(&db->db_mtx); 384c543ec06Sahrens if (db->db_state == DB_EVICTING) { 385c543ec06Sahrens progress = TRUE; 386c543ec06Sahrens evicting = TRUE; 387c543ec06Sahrens mutex_exit(&db->db_mtx); 388c543ec06Sahrens } else if (refcount_is_zero(&db->db_holds)) { 389c543ec06Sahrens progress = TRUE; 390c543ec06Sahrens dbuf_clear(db); /* exits db_mtx for us */ 391c543ec06Sahrens } else { 392c543ec06Sahrens mutex_exit(&db->db_mtx); 393c543ec06Sahrens } 394c543ec06Sahrens 395ea8dc4b6Seschrock } 396d90a49d6Smaybee list_remove(&dn->dn_dbufs, &marker); 397c543ec06Sahrens /* 398c543ec06Sahrens * NB: we need to drop dn_dbufs_mtx between passes so 399c543ec06Sahrens * that any DB_EVICTING dbufs can make progress. 400c543ec06Sahrens * Ideally, we would have some cv we could wait on, but 401c543ec06Sahrens * since we don't, just wait a bit to give the other 402c543ec06Sahrens * thread a chance to run. 403c543ec06Sahrens */ 404c543ec06Sahrens mutex_exit(&dn->dn_dbufs_mtx); 405c543ec06Sahrens if (evicting) 406c543ec06Sahrens delay(1); 407c543ec06Sahrens pass++; 408c543ec06Sahrens ASSERT(pass < 100); /* sanity check */ 409c543ec06Sahrens } while (progress); 410c543ec06Sahrens 411ea8dc4b6Seschrock rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 412ea8dc4b6Seschrock if (dn->dn_bonus && refcount_is_zero(&dn->dn_bonus->db_holds)) { 413ea8dc4b6Seschrock mutex_enter(&dn->dn_bonus->db_mtx); 414ea8dc4b6Seschrock dbuf_evict(dn->dn_bonus); 415ea8dc4b6Seschrock dn->dn_bonus = NULL; 416ea8dc4b6Seschrock } 417ea8dc4b6Seschrock rw_exit(&dn->dn_struct_rwlock); 418ea8dc4b6Seschrock } 419ea8dc4b6Seschrock 420c717a561Smaybee static void 421c717a561Smaybee dnode_undirty_dbufs(list_t *list) 422fa9e4066Sahrens { 423c717a561Smaybee dbuf_dirty_record_t *dr; 424fa9e4066Sahrens 425c717a561Smaybee while (dr = list_head(list)) { 426c717a561Smaybee dmu_buf_impl_t *db = dr->dr_dbuf; 427c717a561Smaybee uint64_t txg = dr->dr_txg; 428fa9e4066Sahrens 429fa9e4066Sahrens mutex_enter(&db->db_mtx); 430fa9e4066Sahrens /* XXX - use dbuf_undirty()? */ 431c717a561Smaybee list_remove(list, dr); 432c717a561Smaybee ASSERT(db->db_last_dirty == dr); 433c717a561Smaybee db->db_last_dirty = NULL; 434c717a561Smaybee db->db_dirtycnt -= 1; 435fa9e4066Sahrens if (db->db_level == 0) { 436ea8dc4b6Seschrock ASSERT(db->db_blkid == DB_BONUS_BLKID || 437c717a561Smaybee dr->dt.dl.dr_data == db->db_buf); 438c717a561Smaybee dbuf_unoverride(dr); 439c717a561Smaybee mutex_exit(&db->db_mtx); 440c717a561Smaybee } else { 441c717a561Smaybee mutex_exit(&db->db_mtx); 442c717a561Smaybee dnode_undirty_dbufs(&dr->dt.di.dr_children); 443fa9e4066Sahrens } 444c717a561Smaybee kmem_free(dr, sizeof (dbuf_dirty_record_t)); 445c717a561Smaybee dbuf_rele(db, (void *)(uintptr_t)txg); 446fa9e4066Sahrens } 447c717a561Smaybee } 448fa9e4066Sahrens 449c717a561Smaybee static void 450c717a561Smaybee dnode_sync_free(dnode_t *dn, dmu_tx_t *tx) 451c717a561Smaybee { 452c717a561Smaybee int txgoff = tx->tx_txg & TXG_MASK; 453c717a561Smaybee 454c717a561Smaybee ASSERT(dmu_tx_is_syncing(tx)); 455c717a561Smaybee 456cdb0ab79Smaybee /* 457cdb0ab79Smaybee * Our contents should have been freed in dnode_sync() by the 458cdb0ab79Smaybee * free range record inserted by the caller of dnode_free(). 459cdb0ab79Smaybee */ 460cdb0ab79Smaybee ASSERT3U(DN_USED_BYTES(dn->dn_phys), ==, 0); 461cdb0ab79Smaybee ASSERT(BP_IS_HOLE(dn->dn_phys->dn_blkptr)); 462cdb0ab79Smaybee 463c717a561Smaybee dnode_undirty_dbufs(&dn->dn_dirty_records[txgoff]); 4641934e92fSmaybee dnode_evict_dbufs(dn); 465ea8dc4b6Seschrock ASSERT3P(list_head(&dn->dn_dbufs), ==, NULL); 466ea8dc4b6Seschrock 467ea8dc4b6Seschrock /* 468ea8dc4b6Seschrock * XXX - It would be nice to assert this, but we may still 469ea8dc4b6Seschrock * have residual holds from async evictions from the arc... 470ea8dc4b6Seschrock * 47155434c77Sek * zfs_obj_to_path() also depends on this being 47255434c77Sek * commented out. 47355434c77Sek * 474ea8dc4b6Seschrock * ASSERT3U(refcount_count(&dn->dn_holds), ==, 1); 475ea8dc4b6Seschrock */ 476fa9e4066Sahrens 477fa9e4066Sahrens /* Undirty next bits */ 478fa9e4066Sahrens dn->dn_next_nlevels[txgoff] = 0; 479fa9e4066Sahrens dn->dn_next_indblkshift[txgoff] = 0; 480c543ec06Sahrens dn->dn_next_blksz[txgoff] = 0; 481fa9e4066Sahrens 482fa9e4066Sahrens /* ASSERT(blkptrs are zero); */ 483fa9e4066Sahrens ASSERT(dn->dn_phys->dn_type != DMU_OT_NONE); 484fa9e4066Sahrens ASSERT(dn->dn_type != DMU_OT_NONE); 485fa9e4066Sahrens 486fa9e4066Sahrens ASSERT(dn->dn_free_txg > 0); 487fa9e4066Sahrens if (dn->dn_allocated_txg != dn->dn_free_txg) 488fa9e4066Sahrens dbuf_will_dirty(dn->dn_dbuf, tx); 489fa9e4066Sahrens bzero(dn->dn_phys, sizeof (dnode_phys_t)); 490fa9e4066Sahrens 491fa9e4066Sahrens mutex_enter(&dn->dn_mtx); 492fa9e4066Sahrens dn->dn_type = DMU_OT_NONE; 493fa9e4066Sahrens dn->dn_maxblkid = 0; 494fa9e4066Sahrens dn->dn_allocated_txg = 0; 495758f6e0bSgw dn->dn_free_txg = 0; 496fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 497fa9e4066Sahrens 498ea8dc4b6Seschrock ASSERT(dn->dn_object != DMU_META_DNODE_OBJECT); 499fa9e4066Sahrens 500fa9e4066Sahrens dnode_rele(dn, (void *)(uintptr_t)tx->tx_txg); 501fa9e4066Sahrens /* 502fa9e4066Sahrens * Now that we've released our hold, the dnode may 503fa9e4066Sahrens * be evicted, so we musn't access it. 504fa9e4066Sahrens */ 505fa9e4066Sahrens } 506fa9e4066Sahrens 507fa9e4066Sahrens /* 508c717a561Smaybee * Write out the dnode's dirty buffers. 509fa9e4066Sahrens * 510fa9e4066Sahrens * NOTE: The dnode is kept in memory by being dirty. Once the 511fa9e4066Sahrens * dirty bit is cleared, it may be evicted. Beware of this! 512fa9e4066Sahrens */ 513c717a561Smaybee void 514c717a561Smaybee dnode_sync(dnode_t *dn, dmu_tx_t *tx) 515fa9e4066Sahrens { 516fa9e4066Sahrens free_range_t *rp; 517fa9e4066Sahrens dnode_phys_t *dnp = dn->dn_phys; 518c717a561Smaybee int txgoff = tx->tx_txg & TXG_MASK; 519c717a561Smaybee list_t *list = &dn->dn_dirty_records[txgoff]; 520fa9e4066Sahrens 521fa9e4066Sahrens ASSERT(dmu_tx_is_syncing(tx)); 522fa9e4066Sahrens ASSERT(dnp->dn_type != DMU_OT_NONE || dn->dn_allocated_txg); 5239c9dc39aSek DNODE_VERIFY(dn); 524c543ec06Sahrens 525c717a561Smaybee ASSERT(dn->dn_dbuf == NULL || arc_released(dn->dn_dbuf->db_buf)); 526fa9e4066Sahrens 527fa9e4066Sahrens mutex_enter(&dn->dn_mtx); 528fa9e4066Sahrens if (dn->dn_allocated_txg == tx->tx_txg) { 529fa9e4066Sahrens /* The dnode is newly allocated or reallocated */ 530fa9e4066Sahrens if (dnp->dn_type == DMU_OT_NONE) { 531fa9e4066Sahrens /* this is a first alloc, not a realloc */ 532fa9e4066Sahrens /* XXX shouldn't the phys already be zeroed? */ 533fa9e4066Sahrens bzero(dnp, DNODE_CORE_SIZE); 534fa9e4066Sahrens dnp->dn_nlevels = 1; 535fa9e4066Sahrens } 536fa9e4066Sahrens 537fa9e4066Sahrens if (dn->dn_nblkptr > dnp->dn_nblkptr) { 538fa9e4066Sahrens /* zero the new blkptrs we are gaining */ 539fa9e4066Sahrens bzero(dnp->dn_blkptr + dnp->dn_nblkptr, 540fa9e4066Sahrens sizeof (blkptr_t) * 541fa9e4066Sahrens (dn->dn_nblkptr - dnp->dn_nblkptr)); 542fa9e4066Sahrens } 543fa9e4066Sahrens dnp->dn_type = dn->dn_type; 544fa9e4066Sahrens dnp->dn_bonustype = dn->dn_bonustype; 545fa9e4066Sahrens dnp->dn_bonuslen = dn->dn_bonuslen; 546fa9e4066Sahrens dnp->dn_nblkptr = dn->dn_nblkptr; 547fa9e4066Sahrens } 548fa9e4066Sahrens 549c717a561Smaybee ASSERT(dnp->dn_nlevels > 1 || 550f676ed34Sahrens BP_IS_HOLE(&dnp->dn_blkptr[0]) || 551f676ed34Sahrens BP_GET_LSIZE(&dnp->dn_blkptr[0]) == 552f676ed34Sahrens dnp->dn_datablkszsec << SPA_MINBLOCKSHIFT); 553f676ed34Sahrens 554c543ec06Sahrens if (dn->dn_next_blksz[txgoff]) { 555c543ec06Sahrens ASSERT(P2PHASE(dn->dn_next_blksz[txgoff], 556fa9e4066Sahrens SPA_MINBLOCKSIZE) == 0); 557f676ed34Sahrens ASSERT(BP_IS_HOLE(&dnp->dn_blkptr[0]) || 558cdb0ab79Smaybee dn->dn_maxblkid == 0 || list_head(list) != NULL || 559347a31bcSahrens dn->dn_next_blksz[txgoff] >> SPA_MINBLOCKSHIFT == 560347a31bcSahrens dnp->dn_datablkszsec); 561fa9e4066Sahrens dnp->dn_datablkszsec = 562c543ec06Sahrens dn->dn_next_blksz[txgoff] >> SPA_MINBLOCKSHIFT; 563c543ec06Sahrens dn->dn_next_blksz[txgoff] = 0; 564fa9e4066Sahrens } 565fa9e4066Sahrens 5661934e92fSmaybee if (dn->dn_next_bonuslen[txgoff]) { 5671934e92fSmaybee if (dn->dn_next_bonuslen[txgoff] == DN_ZERO_BONUSLEN) 5681934e92fSmaybee dnp->dn_bonuslen = 0; 5691934e92fSmaybee else 5701934e92fSmaybee dnp->dn_bonuslen = dn->dn_next_bonuslen[txgoff]; 5711934e92fSmaybee ASSERT(dnp->dn_bonuslen <= DN_MAX_BONUSLEN); 5721934e92fSmaybee dn->dn_next_bonuslen[txgoff] = 0; 5731934e92fSmaybee } 5741934e92fSmaybee 575fa9e4066Sahrens if (dn->dn_next_indblkshift[txgoff]) { 576fa9e4066Sahrens ASSERT(dnp->dn_nlevels == 1); 577fa9e4066Sahrens dnp->dn_indblkshift = dn->dn_next_indblkshift[txgoff]; 578fa9e4066Sahrens dn->dn_next_indblkshift[txgoff] = 0; 579fa9e4066Sahrens } 580fa9e4066Sahrens 581fa9e4066Sahrens /* 582fa9e4066Sahrens * Just take the live (open-context) values for checksum and compress. 583fa9e4066Sahrens * Strictly speaking it's a future leak, but nothing bad happens if we 584fa9e4066Sahrens * start using the new checksum or compress algorithm a little early. 585fa9e4066Sahrens */ 586fa9e4066Sahrens dnp->dn_checksum = dn->dn_checksum; 587fa9e4066Sahrens dnp->dn_compress = dn->dn_compress; 588fa9e4066Sahrens 589fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 590fa9e4066Sahrens 591fa9e4066Sahrens /* process all the "freed" ranges in the file */ 592cdb0ab79Smaybee while (rp = avl_last(&dn->dn_ranges[txgoff])) { 593cdb0ab79Smaybee dnode_sync_free_range(dn, rp->fr_blkid, rp->fr_nblks, tx); 594cdb0ab79Smaybee /* grab the mutex so we don't race with dnode_block_freed() */ 595cdb0ab79Smaybee mutex_enter(&dn->dn_mtx); 596cdb0ab79Smaybee avl_remove(&dn->dn_ranges[txgoff], rp); 597cdb0ab79Smaybee mutex_exit(&dn->dn_mtx); 598cdb0ab79Smaybee kmem_free(rp, sizeof (free_range_t)); 599fa9e4066Sahrens } 6001934e92fSmaybee 601fa9e4066Sahrens if (dn->dn_free_txg > 0 && dn->dn_free_txg <= tx->tx_txg) { 602c717a561Smaybee dnode_sync_free(dn, tx); 603c717a561Smaybee return; 604fa9e4066Sahrens } 605fa9e4066Sahrens 606fa9e4066Sahrens if (dn->dn_next_nlevels[txgoff]) { 607c717a561Smaybee dnode_increase_indirection(dn, tx); 608fa9e4066Sahrens dn->dn_next_nlevels[txgoff] = 0; 609fa9e4066Sahrens } 610fa9e4066Sahrens 611c717a561Smaybee dbuf_sync_list(list, tx); 612fa9e4066Sahrens 613c717a561Smaybee if (dn->dn_object != DMU_META_DNODE_OBJECT) { 614c717a561Smaybee ASSERT3P(list_head(list), ==, NULL); 615c717a561Smaybee dnode_rele(dn, (void *)(uintptr_t)tx->tx_txg); 616fa9e4066Sahrens } 617c717a561Smaybee 618c717a561Smaybee /* 619c717a561Smaybee * Although we have dropped our reference to the dnode, it 620c717a561Smaybee * can't be evicted until its written, and we haven't yet 621c717a561Smaybee * initiated the IO for the dnode's dbuf. 622c717a561Smaybee */ 623fa9e4066Sahrens } 624