dbuf.c revision d0ad202d2eff2cc0c70ee550686a703ddda7106c
/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License (the "License").
* You may not use this file except in compliance with the License.
*
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information: Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*/
/*
* Copyright 2007 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
#pragma ident "%Z%%M% %I% %E% SMI"
#include <sys/zfs_context.h>
#include <sys/dmu_impl.h>
#include <sys/dmu_objset.h>
#include <sys/dsl_dataset.h>
#include <sys/dmu_zfetch.h>
static arc_done_func_t dbuf_write_ready;
static arc_done_func_t dbuf_write_done;
int zfs_mdcomp_disable = 0;
/*
* Global data structures and functions for the dbuf cache.
*/
static kmem_cache_t *dbuf_cache;
/* ARGSUSED */
static int
{
return (0);
}
/* ARGSUSED */
static void
{
}
/*
* dbuf hash table routines
*/
static dbuf_hash_table_t dbuf_hash_table;
static uint64_t dbuf_hash_count;
static uint64_t
{
return (crc);
}
{
dbuf_hash_table_t *h = &dbuf_hash_table;
return (db);
}
}
}
return (NULL);
}
/*
* Insert an entry into the hash table. If there is already an element
* equal to elem in the hash table, then the already existing element
* will be returned and the new element will not be inserted.
* Otherwise returns NULL.
*/
static dmu_buf_impl_t *
{
dbuf_hash_table_t *h = &dbuf_hash_table;
return (dbf);
}
}
}
return (NULL);
}
/*
* Remove an entry from the hash table. This operation will
* fail if there are any existing holds on the db.
*/
static void
{
dbuf_hash_table_t *h = &dbuf_hash_table;
/*
* We musn't hold db_mtx to maintin lock ordering:
* DBUF_HASH_MUTEX > db_mtx.
*/
}
}
static arc_evict_func_t dbuf_do_evict;
static void
{
return;
if (db->db_user_data_ptr_ptr)
}
void
{
dbuf_clear(db);
}
void
dbuf_init(void)
{
dbuf_hash_table_t *h = &dbuf_hash_table;
int i;
/*
* The hash table is big enough to fill all of physical memory
* with an average 4K block size. The table will take up
*/
hsize <<= 1;
if (h->hash_table == NULL) {
/* XXX - we should really return an error instead of assert */
hsize >>= 1;
goto retry;
}
sizeof (dmu_buf_impl_t),
for (i = 0; i < DBUF_MUTEXES; i++)
}
void
dbuf_fini(void)
{
dbuf_hash_table_t *h = &dbuf_hash_table;
int i;
for (i = 0; i < DBUF_MUTEXES; i++)
mutex_destroy(&h->hash_mutexes[i]);
}
/*
* Other stuff.
*/
#ifdef ZFS_DEBUG
static void
{
if (!(zfs_flags & ZFS_DEBUG_DBUF_VERIFY))
return;
} else {
}
} else {
}
/* we can be momentarily larger in dnode_set_blksz() */
}
/*
* it should only be modified in syncing
* context, so make sure we only have
* one copy of the data.
*/
}
}
/* verify db->db_blkptr */
/* db is pointed to by the dnode */
/* ASSERT3U(db->db_blkid, <, dn->dn_nblkptr); */
else
} else {
/* db is pointed to by an indirect block */
/*
* dnode_grow_indblksz() can make this fail if we don't
* have the struct_rwlock. XXX indblksz no longer
* grows. safe to do this now?
*/
}
}
}
/*
* If the blkptr isn't set but they have nonzero data,
* it had better be dirty, otherwise we'll lose that
* data when we evict this buffer.
*/
if (db->db_dirtycnt == 0) {
int i;
}
}
}
}
#endif
static void
{
}
}
static void
{
if (!arc_released(buf))
} else {
}
}
{
if (dn->dn_datablkshift) {
} else {
return (0);
}
}
static void
{
/*
* All reads are synchronous, so we must have a hold on the dbuf
*/
/* we were freed in flight; disregard any error */
} else {
}
}
static void
{
/* We need the struct_rwlock to prevent db_blkptr from changing. */
return;
}
else
else
*flags |= DB_RF_CACHED;
return;
}
/* ZIO_FLAG_CANFAIL callers have to check the parent zio's error */
if (aflags & ARC_CACHED)
*flags |= DB_RF_CACHED;
}
int
{
int err = 0;
int prefetch;
/*
* We don't have to hold the mutex to check db_state because it
* can't be freed while we have a hold on the buffer.
*/
if ((flags & DB_RF_HAVESTRUCT) == 0)
if (prefetch)
if ((flags & DB_RF_HAVESTRUCT) == 0)
}
/* dbuf_read_impl has dropped db_mtx for us */
if (prefetch)
if ((flags & DB_RF_HAVESTRUCT) == 0)
if (!havepzio)
} else {
if (prefetch)
if ((flags & DB_RF_HAVESTRUCT) == 0)
if ((flags & DB_RF_NEVERWAIT) == 0) {
(flags & DB_RF_HAVESTRUCT) == 0);
}
}
}
return (err);
}
static void
{
} else {
}
}
/*
* This is our just-in-time copy function. It makes a copy of
* buffers, that have been modified in a previous transaction
* group, before we modify them in the current active group.
*
* This function is used in two places: when we are dirtying a
* buffer for the first time in a txg, and when we are freeing
* a range in a dnode that includes this buffer.
*
* Note that when we are called from dbuf_free_range() we do
* not put a hold on the buffer, we just traverse the active
* dbuf list for the dnode.
*/
static void
{
return;
/*
* If the last dirty record for this dbuf has not yet synced
* and its referencing the dbuf data, either:
* reset the reference to point to a new copy,
* or (if there a no active holders)
* just null out the current db_data pointer.
*/
/* Note that the data bufs here are zio_bufs */
} else {
}
}
void
{
return;
/* free this block */
/* XXX can get silent EIO here */
}
/*
* Release the already-written buffer, so we leave it in
* a consistent dirty state. Note that all callers are
* modifying the buffer, so they will immediately do
* another (redundant) arc_release(). Therefore, leave
* the buf thawed to save the effort of freezing &
* immediately re-thawing it.
*/
}
void
{
continue;
continue;
/* found a level 0 buffer in the range */
continue;
continue;
}
/* will be handled in dbuf_read_done or dbuf_rele */
continue;
}
dbuf_clear(db);
continue;
}
/* The dbuf is referenced */
/*
* This buffer is "in-use", re-adjust the file
* size to reflect that this buffer may
* contain new data when we sync.
*/
} else {
/*
* This dbuf is not dirty in the open context.
* Either uncache it (if its not referenced in
* the open context) or reset its contents to
* empty.
*/
}
}
/* clear the contents if its cached */
}
}
}
static int
{
/* Don't count meta-objects */
return (FALSE);
/*
* We don't need any locking to protect db_blkptr:
* If it's syncing, then db_last_dirty will be set
* so we'll ignore db_blkptr.
*/
/* If we have been dirtied since the last snapshot, its not new */
if (db->db_last_dirty)
if (birth_txg)
else
return (TRUE);
}
void
{
/* XXX does *this* func really need the lock? */
/*
* This call to dbuf_will_dirty() with the dn_struct_rwlock held
* is OK, because there can be no other references to the db
* when we are changing its size, so no concurrent DB_FILL can
* be happening.
*/
/*
* XXX we should be doing a dbuf_read, checking the return
* value and returning that up to our callers
*/
/* create the data buffer for the new block */
/* copy old block data to the new block */
/* zero the remainder */
}
}
{
int drop_struct_lock = FALSE;
/*
* Shouldn't dirty a regular buffer in syncing context. Private
* objects may be dirtied in syncing context, but only if they
* were already pre-dirtied in open context.
* XXX We may want to prohibit dirtying in syncing context even
* if they did pre-dirty.
*/
/*
* We make this assert for private objects as well, but after we
* check if we're already dirty. They are allowed to re-dirty
* in syncing context.
*/
/*
* XXX make this true for indirects too? The problem is that
* transactions created with dmu_tx_create_assigned() from
* syncing context don't bother holding ahead.
*/
/*
* Don't set dirtyctx to SYNC if we're just modifying this as we
* initialize the objset.
*/
dn->dn_dirtyctx =
}
/*
* If this buffer is already dirty, we're done.
*/
/*
* If this buffer has already been written out,
* we now need to reset its state.
*/
}
return (*drp);
}
/*
* Only valid if not already dirty.
*/
/*
* We should only be dirtying in syncing context if it's the
* mos, a spa os, or we're initializing the os. However, we are
* allowed to dirty in syncing context provided we already
* dirtied it in open context. Hence we must make this
* assertion only if we're not already dirty.
*/
/*
* If this buffer is dirty in an old transaction group we need
* to make a copy of it so that the changes we make in this
* transaction group won't leak out when we sync the older txg.
*/
/*
* Release the data buffer from the cache so that we
* can modify it without impacting possible other users
* of this cached data block. Note that indirect
* blocks and private objects are not released until the
* syncing state (since they are only modified then).
*/
}
} else {
sizeof (dbuf_dirty_record_t),
}
/*
* We could have been freed_in_flight between the dbuf_noread
* and dbuf_dirty. We win, as though the dbuf_noread() had
* happened after the free.
*/
}
/*
* Update the accounting.
*/
/*
* This is only a guess -- if the dbuf is dirty
* in a previous txg, we don't know how much
* space it will use on disk yet. We should
* really have the struct_rwlock to access
* db_blkptr, but since this is just a guess,
* it's OK if we get an odd answer.
*/
}
}
/*
* This buffer is now part of this txg
*/
return (dr);
}
}
}
int parent_held = FALSE;
parent_held = TRUE;
}
if (drop_struct_lock)
if (parent_held)
/* possible race with dbuf_undirty() */
}
} else {
if (drop_struct_lock)
}
return (dr);
}
static int
{
/*
* If this buffer is not dirty, we're done.
*/
break;
return (0);
}
/*
* If this buffer is currently held, we cannot undirty
* it, since one of the current holders may be in the
* middle of an update. Note that users of dbuf_undirty()
* should not place a hold on the dbuf before the call.
*/
/* Make sure we don't toss this buffer at sync phase */
return (0);
}
/* XXX would be nice to fix up dn_towrite_space[] */
}
} else {
/* XXX - mutex and list destroy? */
}
dbuf_evict(db);
return (1);
}
return (0);
}
void
{
int rf = DB_RF_MUST_SUCCEED;
rf |= DB_RF_HAVESTRUCT;
}
void
{
}
/* ARGSUSED */
void
{
/* we were freed while filling */
/* XXX dbuf_undirty? */
}
}
}
/*
* "Clear" the contents of this dbuf. This will mark the dbuf
* EVICTING and clear *most* of its references. Unfortunetely,
* when we are not holding the dn_dbufs_mtx, we can't clear the
* entry in the dn_dbufs list. We have to wait until dbuf_destroy()
* in this case. For callers from the DMU we will usually see:
* dbuf_clear()->arc_buf_evict()->dbuf_do_evict()->dbuf_destroy()
* For the arc callback, we will usually see:
* dbuf_do_evict()->dbuf_clear();dbuf_destroy()
* Sometimes, though, we will get a mix of these two:
* DMU: dbuf_clear()->arc_buf_evict()
* ARC: dbuf_do_evict()->dbuf_destroy()
*/
void
{
}
}
if (!dbuf_gone)
/*
* If this dbuf is referened from an indirect dbuf,
* decrement the ref count on the indirect dbuf.
*/
}
static int
{
nlevels = 1;
else
/* the buffer has no parent yet */
return (ENOENT);
/* this block is referenced from an indirect block */
if (err)
return (err);
if (err) {
return (err);
}
return (0);
} else {
/* the block is referenced from the dnode */
}
return (0);
}
}
static dmu_buf_impl_t *
{
db->db_dirtycnt = 0;
db->db_immediate_evict = 0;
db->db_freed_in_flight = 0;
if (blkid == DB_BONUS_BLKID) {
/* the bonus dbuf is not placed in the hash table */
return (db);
} else {
int blocksize =
}
/*
* Hold the dn_dbufs_mtx while we get the new dbuf
* in the hash table *and* added to the dbufs list.
* This prevents a possible deadlock with someone
* trying to look up this dbuf before its added to the
* dn_dbufs list.
*/
/* someone else inserted it first */
return (odb);
}
return (db);
}
static int
dbuf_do_evict(void *private)
{
dbuf_evict(db);
} else {
}
return (0);
}
static void
{
/*
* If this dbuf is still on the dn_dbufs list,
* remove it from that list.
*/
}
}
}
void
{
return;
/* dbuf_find() returns with db_mtx held */
/*
* This dbuf is active. We assume that it is
* already CACHED, or else about to be either
* read or filled.
*/
return;
}
}
}
if (db)
}
}
/*
* Returns with db_holds incremented, and db_mtx not held.
* Note: dn_struct_rwlock must be held.
*/
int
{
top:
/* dbuf_find() returns with db_mtx held */
int err;
if (fail_sparse) {
if (err) {
if (parent)
return (err);
}
}
return (err);
}
dbuf_clear(db);
if (parent) {
}
goto top;
}
}
/*
* If this buffer is currently syncing out, and we are are
* still referencing it from db_data, we need to make a copy
* of it in case we decide we want to dirty it again in this txg.
*/
}
}
/* NOTE: we can't rele the parent until after we drop the db_mtx */
if (parent)
return (0);
}
{
}
{
}
{
return (db);
}
void
{
}
void
{
/*
* We can't freeze indirects if there is a possibility that they
* may be modified in the current syncing context.
*/
if (holds == 0) {
/*
* This is a special case: we never associated this
* dbuf with any data allocated from the ARC.
*/
dbuf_evict(db);
/*
* This dbuf has anonymous data associated with it.
*/
dbuf_evict(db);
} else {
}
} else {
}
}
{
}
void *
{
}
void *
{
}
void *
{
} else {
}
return (old_user_ptr);
}
void *
{
return (db->db_user_ptr);
}
static void
{
/* ASSERT(dmu_tx_is_syncing(tx) */
return;
/*
* This buffer was allocated at a time when there was
* no available blkptrs from the dnode, or it was
* inappropriate to hook it in (i.e., nlevels mis-match).
*/
} else {
}
}
}
static void
{
}
/*
* XXX -- we should design a compression algorithm
* that specializes in arrays of bps.
*/
}
static void
{
int blksz;
/*
* To be synced, we must be dirtied. But we
* might have been freed after the dirty.
*/
/* This buffer has been freed since it was dirtied */
/* This buffer was freed and is now being re-filled */
} else {
}
/*
* If this is a bonus buffer, simply copy the bonus data into the
* dnode. It will be written out when the dnode is synced (and it
* will be synced, since it must have been dirty for dbuf_sync to
* be called).
*/
/*
* Use dn_phys->dn_bonuslen since db.db_size is the length
* of the bonus buffer in the open transaction rather than
* the syncing transaction.
*/
return;
}
/*
* If this buffer is in the middle of an immdiate write,
* wait for the synchronous IO to complete.
*/
}
/*
* If this dbuf has already been written out via an immediate write,
* just complete the write by copying over the new block pointer and
* updating the accounting via the write-completion functions.
*/
return;
}
/*
* If this buffer is currently "in use" (i.e., there are
* active holds and db_data still references it), then make
* a copy before we start the write so that any modifications
* from the open txg will not leak into this write.
*
* NOTE: this copy does not need to be made for objects only
* modified in the syncing context (e.g. DNONE_DNODE blocks).
*/
}
} else {
/*
* Private object buffers are released here rather
* than in dbuf_dirty() since they are only modified
* in the syncing context and we don't want the
* overhead of making multiple copies of the data.
*/
}
/*
* Allow dnode settings to override objset settings,
* except for metadata checksums.
*/
os->os_md_compress);
} else {
os->os_checksum);
os->os_compress);
}
else
}
void
{
/*
* If we find an already initialized zio then we
* are processing the meta-dnode, and we have finished.
* The dbufs for all dnodes are put back on the list
* during processing, so that we can zio_wait()
* these IOs after initiating all child IOs.
*/
break;
}
else
}
}
static void
{
int zio_flags;
} else {
}
}
/* ARGSUSED */
static void
{
return;
}
i--, dnp++) {
fill++;
}
} else {
fill = 1;
}
} else {
if (BP_IS_HOLE(bp))
continue;
}
}
/* We must do this after we've set the bp's type and level */
}
}
/* ARGSUSED */
static void
{
else
} else {
int epbs =
}
}
}