xref: /dragonfly/sys/vfs/hammer/hammer_transaction.c (revision 36f82b23)

/*
 * Copyright (c) 2007 The DragonFly Project.  All rights reserved.
 *
 * This code is derived from software contributed to The DragonFly Project
 * by Matthew Dillon <dillon@backplane.com>
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in
 *    the documentation and/or other materials provided with the
 *    distribution.
 * 3. Neither the name of The DragonFly Project nor the names of its
 *    contributors may be used to endorse or promote products derived
 *    from this software without specific, prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE
 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 *
 * $DragonFly: src/sys/vfs/hammer/hammer_transaction.c,v 1.10 2008/03/19 20:18:17 dillon Exp $
 */

#include "hammer.h"

void
hammer_start_transaction(struct hammer_transaction *trans,
			 struct hammer_mount *hmp)
{
	int error;

	trans->hmp = hmp;
	trans->rootvol = hammer_get_root_volume(hmp, &error);
	KKASSERT(error == 0);
	trans->tid = hammer_alloc_tid(trans);
}

void
hammer_simple_transaction(struct hammer_transaction *trans,
			  struct hammer_mount *hmp)
{
	int error;

	trans->hmp = hmp;
	trans->rootvol = hammer_get_root_volume(hmp, &error);
	trans->tid = 0;
	KKASSERT(error == 0);
}

void
hammer_start_transaction_tid(struct hammer_transaction *trans,
			     struct hammer_mount *hmp, hammer_tid_t tid)
{
	int error;

	trans->hmp = hmp;
	trans->rootvol = hammer_get_root_volume(hmp, &error);
	KKASSERT(error == 0);
	trans->tid = tid;
}

void
hammer_abort_transaction(struct hammer_transaction *trans)
{
	hammer_rel_volume(trans->rootvol, 0);
}

void
hammer_commit_transaction(struct hammer_transaction *trans)
{
	hammer_rel_volume(trans->rootvol, 0);
}

/*
 * Note: Successive transaction ids must be at least 2 apart so the
 * B-Tree code can make a separator that does not match either the
 * left or right hand sides.
 */
hammer_tid_t
hammer_alloc_tid(hammer_transaction_t trans)
{
	hammer_volume_ondisk_t ondisk;
	struct timespec ts;
	hammer_tid_t tid;

	getnanotime(&ts);
	tid = ts.tv_sec * 1000000000LL + ts.tv_nsec;
	hammer_modify_volume(trans, trans->rootvol, NULL, 0);
	ondisk = trans->rootvol->ondisk;
	if (tid < ondisk->vol0_next_tid)
		tid = ondisk->vol0_next_tid;
	if (tid == 0xFFFFFFFFFFFFFFFFULL)
		panic("hammer_start_transaction: Ran out of TIDs!");
	if (hammer_debug_tid) {
		kprintf("alloc_tid %016llx (0x%08x)\n",
			tid, (int)(tid / 1000000000LL));
	}
	ondisk->vol0_next_tid = tid + 2;

	return(tid);
}