Lines Matching defs:blkid
2064 dnode_new_blkid(dnode_t *dn, uint64_t blkid, dmu_tx_t *tx, boolean_t have_read,
2070 ASSERT(blkid != DMU_BONUS_BLKID);
2081 if (blkid <= dn->dn_maxblkid)
2092 * given blkid even if the value is lower than the current value.
2094 if (!force && blkid <= dn->dn_maxblkid)
2102 dn->dn_maxblkid = blkid;
2104 blkid | DMU_NEXT_MAXBLKID_SET;
2113 sz <= blkid && sz >= dn->dn_nblkptr; sz <<= epbs)
2171 * Setup the next blkid we want to search for.
2270 uint64_t blkoff, blkid, nblks;
2298 blkid = 0;
2355 blkid = off >> blkshift;
2384 first = blkid >> epbs;
2389 last = (blkid + nblks - 1) >> epbs;
2441 range_tree_clear(dn->dn_free_ranges[txgoff], blkid, nblks);
2442 range_tree_add(dn->dn_free_ranges[txgoff], blkid, nblks);
2444 dprintf_dnode(dn, "blkid=%llu nblks=%llu txg=%llu\n",
2445 (u_longlong_t)blkid, (u_longlong_t)nblks,
2449 dbuf_free_range(dn, blkid, blkid + nblks - 1, tx);
2467 /* return TRUE if this blkid was freed in a recent txg, or FALSE if it wasn't */
2469 dnode_block_freed(dnode_t *dn, uint64_t blkid)
2473 if (blkid == DMU_BONUS_BLKID)
2479 if (blkid == DMU_SPILL_BLKID)
2485 range_tree_contains(dn->dn_free_ranges[i], blkid, 1))
2562 uint64_t blkid = dbuf_whichblock(dn, lvl, *offset);
2563 error = dbuf_hold_impl(dn, lvl, blkid, TRUE, FALSE, FTAG, &db);