Lines Matching defs:blkid
1442 dnode_new_blkid(dnode_t *dn, uint64_t blkid, dmu_tx_t *tx, boolean_t have_read)
1448 ASSERT(blkid != DMU_BONUS_BLKID);
1459 if (blkid <= dn->dn_maxblkid)
1468 if (blkid <= dn->dn_maxblkid)
1471 dn->dn_maxblkid = blkid;
1479 sz <= blkid && sz >= dn->dn_nblkptr; sz <<= epbs)
1537 uint64_t blkoff, blkid, nblks;
1570 blkid = 0;
1647 blkid = off >> blkshift;
1675 first = blkid >> epbs;
1680 last = (blkid + nblks - 1) >> epbs;
1728 range_tree_clear(dn->dn_free_ranges[txgoff], blkid, nblks);
1729 range_tree_add(dn->dn_free_ranges[txgoff], blkid, nblks);
1730 dprintf_dnode(dn, "blkid=%llu nblks=%llu txg=%llu\n",
1731 blkid, nblks, tx->tx_txg);
1734 dbuf_free_range(dn, blkid, blkid + nblks - 1, tx);
1755 /* return TRUE if this blkid was freed in a recent txg, or FALSE if it wasn't */
1757 dnode_block_freed(dnode_t *dn, uint64_t blkid)
1762 if (blkid == DMU_BONUS_BLKID)
1775 if (blkid == DMU_SPILL_BLKID)
1781 range_tree_contains(dn->dn_free_ranges[i], blkid, 1))
1878 uint64_t blkid = dbuf_whichblock(dn, lvl, *offset);
1879 error = dbuf_hold_impl(dn, lvl, blkid, TRUE, FALSE, FTAG, &db);