[linux-block.git] / fs / nilfs2 / bmap.c

/*
 * bmap.c - NILFS block mapping.
 *
 * Copyright (C) 2006-2008 Nippon Telegraph and Telephone Corporation.
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
 *
 * Written by Koji Sato <koji@osrg.net>.
 */

#include <linux/fs.h>
#include <linux/string.h>
#include <linux/errno.h>
#include "nilfs.h"
#include "bmap.h"
#include "sb.h"
#include "btnode.h"
#include "mdt.h"
#include "dat.h"
#include "alloc.h"

struct inode *nilfs_bmap_get_dat(const struct nilfs_bmap *bmap)
{
	return nilfs_dat_inode(NILFS_I_NILFS(bmap->b_inode));
}

int nilfs_bmap_lookup_at_level(struct nilfs_bmap *bmap, __u64 key, int level,
			       __u64 *ptrp)
{
	sector_t blocknr;
	int ret;

	down_read(&bmap->b_sem);
	ret = bmap->b_ops->bop_lookup(bmap, key, level, ptrp);
	if (ret < 0)
		goto out;
	if (NILFS_BMAP_USE_VBN(bmap)) {
		ret = nilfs_dat_translate(nilfs_bmap_get_dat(bmap), *ptrp,
					  &blocknr);
		if (!ret)
			*ptrp = blocknr;
	}

 out:
	up_read(&bmap->b_sem);
	return ret;
}

int nilfs_bmap_lookup_contig(struct nilfs_bmap *bmap, __u64 key, __u64 *ptrp,
			     unsigned maxblocks)
{
	int ret;

	down_read(&bmap->b_sem);
	ret = bmap->b_ops->bop_lookup_contig(bmap, key, ptrp, maxblocks);
	up_read(&bmap->b_sem);
	return ret;
}

/**
 * nilfs_bmap_lookup - find a record
 * @bmap: bmap
 * @key: key
 * @recp: pointer to record
 *
 * Description: nilfs_bmap_lookup() finds a record whose key matches @key in
 * @bmap.
 *
 * Return Value: On success, 0 is returned and the record associated with @key
 * is stored in the place pointed by @recp. On error, one of the following
 * negative error codes is returned.
 *
 * %-EIO - I/O error.
 *
 * %-ENOMEM - Insufficient amount of memory available.
 *
 * %-ENOENT - A record associated with @key does not exist.
 */
int nilfs_bmap_lookup(struct nilfs_bmap *bmap,
		      unsigned long key,
		      unsigned long *recp)
{
	__u64 ptr;
	int ret;

	/* XXX: use macro for level 1 */
	ret = nilfs_bmap_lookup_at_level(bmap, key, 1, &ptr);
	if (recp != NULL)
		*recp = ptr;
	return ret;
}

static int nilfs_bmap_do_insert(struct nilfs_bmap *bmap, __u64 key, __u64 ptr)
{
	__u64 keys[NILFS_BMAP_SMALL_HIGH + 1];
	__u64 ptrs[NILFS_BMAP_SMALL_HIGH + 1];
	int ret, n;

	if (bmap->b_ops->bop_check_insert != NULL) {
		ret = bmap->b_ops->bop_check_insert(bmap, key);
		if (ret > 0) {
			n = bmap->b_ops->bop_gather_data(
				bmap, keys, ptrs, NILFS_BMAP_SMALL_HIGH + 1);
			if (n < 0)
				return n;
			ret = nilfs_btree_convert_and_insert(
				bmap, key, ptr, keys, ptrs, n);
			if (ret == 0)
				bmap->b_u.u_flags |= NILFS_BMAP_LARGE;

			return ret;
		} else if (ret < 0)
			return ret;
	}

	return bmap->b_ops->bop_insert(bmap, key, ptr);
}

/**
 * nilfs_bmap_insert - insert a new key-record pair into a bmap
 * @bmap: bmap
 * @key: key
 * @rec: record
 *
 * Description: nilfs_bmap_insert() inserts the new key-record pair specified
 * by @key and @rec into @bmap.
 *
 * Return Value: On success, 0 is returned. On error, one of the following
 * negative error codes is returned.
 *
 * %-EIO - I/O error.
 *
 * %-ENOMEM - Insufficient amount of memory available.
 *
 * %-EEXIST - A record associated with @key already exist.
 */
int nilfs_bmap_insert(struct nilfs_bmap *bmap,
		      unsigned long key,
		      unsigned long rec)
{
	int ret;

	down_write(&bmap->b_sem);
	ret = nilfs_bmap_do_insert(bmap, key, rec);
	up_write(&bmap->b_sem);
	return ret;
}

static int nilfs_bmap_do_delete(struct nilfs_bmap *bmap, __u64 key)
{
	__u64 keys[NILFS_BMAP_LARGE_LOW + 1];
	__u64 ptrs[NILFS_BMAP_LARGE_LOW + 1];
	int ret, n;

	if (bmap->b_ops->bop_check_delete != NULL) {
		ret = bmap->b_ops->bop_check_delete(bmap, key);
		if (ret > 0) {
			n = bmap->b_ops->bop_gather_data(
				bmap, keys, ptrs, NILFS_BMAP_LARGE_LOW + 1);
			if (n < 0)
				return n;
			ret = nilfs_direct_delete_and_convert(
				bmap, key, keys, ptrs, n);
			if (ret == 0)
				bmap->b_u.u_flags &= ~NILFS_BMAP_LARGE;

			return ret;
		} else if (ret < 0)
			return ret;
	}

	return bmap->b_ops->bop_delete(bmap, key);
}

int nilfs_bmap_last_key(struct nilfs_bmap *bmap, unsigned long *key)
{
	__u64 lastkey;
	int ret;

	down_read(&bmap->b_sem);
	ret = bmap->b_ops->bop_last_key(bmap, &lastkey);
	if (!ret)
		*key = lastkey;
	up_read(&bmap->b_sem);
	return ret;
}

/**
 * nilfs_bmap_delete - delete a key-record pair from a bmap
 * @bmap: bmap
 * @key: key
 *
 * Description: nilfs_bmap_delete() deletes the key-record pair specified by
 * @key from @bmap.
 *
 * Return Value: On success, 0 is returned. On error, one of the following
 * negative error codes is returned.
 *
 * %-EIO - I/O error.
 *
 * %-ENOMEM - Insufficient amount of memory available.
 *
 * %-ENOENT - A record associated with @key does not exist.
 */
int nilfs_bmap_delete(struct nilfs_bmap *bmap, unsigned long key)
{
	int ret;

	down_write(&bmap->b_sem);
	ret = nilfs_bmap_do_delete(bmap, key);
	up_write(&bmap->b_sem);
	return ret;
}

static int nilfs_bmap_do_truncate(struct nilfs_bmap *bmap, unsigned long key)
{
	__u64 lastkey;
	int ret;

	ret = bmap->b_ops->bop_last_key(bmap, &lastkey);
	if (ret < 0) {
		if (ret == -ENOENT)
			ret = 0;
		return ret;
	}

	while (key <= lastkey) {
		ret = nilfs_bmap_do_delete(bmap, lastkey);
		if (ret < 0)
			return ret;
		ret = bmap->b_ops->bop_last_key(bmap, &lastkey);
		if (ret < 0) {
			if (ret == -ENOENT)
				ret = 0;
			return ret;
		}
	}
	return 0;
}

/**
 * nilfs_bmap_truncate - truncate a bmap to a specified key
 * @bmap: bmap
 * @key: key
 *
 * Description: nilfs_bmap_truncate() removes key-record pairs whose keys are
 * greater than or equal to @key from @bmap.
 *
 * Return Value: On success, 0 is returned. On error, one of the following
 * negative error codes is returned.
 *
 * %-EIO - I/O error.
 *
 * %-ENOMEM - Insufficient amount of memory available.
 */
int nilfs_bmap_truncate(struct nilfs_bmap *bmap, unsigned long key)
{
	int ret;

	down_write(&bmap->b_sem);
	ret = nilfs_bmap_do_truncate(bmap, key);
	up_write(&bmap->b_sem);
	return ret;
}

/**
 * nilfs_bmap_clear - free resources a bmap holds
 * @bmap: bmap
 *
 * Description: nilfs_bmap_clear() frees resources associated with @bmap.
 */
void nilfs_bmap_clear(struct nilfs_bmap *bmap)
{
	down_write(&bmap->b_sem);
	if (bmap->b_ops->bop_clear != NULL)
		bmap->b_ops->bop_clear(bmap);
	up_write(&bmap->b_sem);
}

/**
 * nilfs_bmap_propagate - propagate dirty state
 * @bmap: bmap
 * @bh: buffer head
 *
 * Description: nilfs_bmap_propagate() marks the buffers that directly or
 * indirectly refer to the block specified by @bh dirty.
 *
 * Return Value: On success, 0 is returned. On error, one of the following
 * negative error codes is returned.
 *
 * %-EIO - I/O error.
 *
 * %-ENOMEM - Insufficient amount of memory available.
 */
int nilfs_bmap_propagate(struct nilfs_bmap *bmap, struct buffer_head *bh)
{
	int ret;

	down_write(&bmap->b_sem);
	ret = bmap->b_ops->bop_propagate(bmap, bh);
	up_write(&bmap->b_sem);
	return ret;
}

/**
 * nilfs_bmap_lookup_dirty_buffers -
 * @bmap: bmap
 * @listp: pointer to buffer head list
 */
void nilfs_bmap_lookup_dirty_buffers(struct nilfs_bmap *bmap,
				     struct list_head *listp)
{
	if (bmap->b_ops->bop_lookup_dirty_buffers != NULL)
		bmap->b_ops->bop_lookup_dirty_buffers(bmap, listp);
}

/**
 * nilfs_bmap_assign - assign a new block number to a block
 * @bmap: bmap
 * @bhp: pointer to buffer head
 * @blocknr: block number
 * @binfo: block information
 *
 * Description: nilfs_bmap_assign() assigns the block number @blocknr to the
 * buffer specified by @bh.
 *
 * Return Value: On success, 0 is returned and the buffer head of a newly
 * create buffer and the block information associated with the buffer are
 * stored in the place pointed by @bh and @binfo, respectively. On error, one
 * of the following negative error codes is returned.
 *
 * %-EIO - I/O error.
 *
 * %-ENOMEM - Insufficient amount of memory available.
 */
int nilfs_bmap_assign(struct nilfs_bmap *bmap,
		      struct buffer_head **bh,
		      unsigned long blocknr,
		      union nilfs_binfo *binfo)
{
	int ret;

	down_write(&bmap->b_sem);
	ret = bmap->b_ops->bop_assign(bmap, bh, blocknr, binfo);
	up_write(&bmap->b_sem);
	return ret;
}

/**
 * nilfs_bmap_mark - mark block dirty
 * @bmap: bmap
 * @key: key
 * @level: level
 *
 * Description: nilfs_bmap_mark() marks the block specified by @key and @level
 * as dirty.
 *
 * Return Value: On success, 0 is returned. On error, one of the following
 * negative error codes is returned.
 *
 * %-EIO - I/O error.
 *
 * %-ENOMEM - Insufficient amount of memory available.
 */
int nilfs_bmap_mark(struct nilfs_bmap *bmap, __u64 key, int level)
{
	int ret;

	if (bmap->b_ops->bop_mark == NULL)
		return 0;

	down_write(&bmap->b_sem);
	ret = bmap->b_ops->bop_mark(bmap, key, level);
	up_write(&bmap->b_sem);
	return ret;
}

/**
 * nilfs_bmap_test_and_clear_dirty - test and clear a bmap dirty state
 * @bmap: bmap
 *
 * Description: nilfs_test_and_clear() is the atomic operation to test and
 * clear the dirty state of @bmap.
 *
 * Return Value: 1 is returned if @bmap is dirty, or 0 if clear.
 */
int nilfs_bmap_test_and_clear_dirty(struct nilfs_bmap *bmap)
{
	int ret;

	down_write(&bmap->b_sem);
	ret = nilfs_bmap_dirty(bmap);
	nilfs_bmap_clear_dirty(bmap);
	up_write(&bmap->b_sem);
	return ret;
}


/*
 * Internal use only
 */

void nilfs_bmap_add_blocks(const struct nilfs_bmap *bmap, int n)
{
	inode_add_bytes(bmap->b_inode, (1 << bmap->b_inode->i_blkbits) * n);
	if (NILFS_MDT(bmap->b_inode))
		nilfs_mdt_mark_dirty(bmap->b_inode);
	else
		mark_inode_dirty(bmap->b_inode);
}

void nilfs_bmap_sub_blocks(const struct nilfs_bmap *bmap, int n)
{
	inode_sub_bytes(bmap->b_inode, (1 << bmap->b_inode->i_blkbits) * n);
	if (NILFS_MDT(bmap->b_inode))
		nilfs_mdt_mark_dirty(bmap->b_inode);
	else
		mark_inode_dirty(bmap->b_inode);
}

__u64 nilfs_bmap_data_get_key(const struct nilfs_bmap *bmap,
			      const struct buffer_head *bh)
{
	struct buffer_head *pbh;
	__u64 key;

	key = page_index(bh->b_page) << (PAGE_CACHE_SHIFT -
					 bmap->b_inode->i_blkbits);
	for (pbh = page_buffers(bh->b_page); pbh != bh;
	     pbh = pbh->b_this_page, key++);

	return key;
}

__u64 nilfs_bmap_find_target_seq(const struct nilfs_bmap *bmap, __u64 key)
{
	__s64 diff;

	diff = key - bmap->b_last_allocated_key;
	if ((nilfs_bmap_keydiff_abs(diff) < NILFS_INODE_BMAP_SIZE) &&
	    (bmap->b_last_allocated_ptr != NILFS_BMAP_INVALID_PTR) &&
	    (bmap->b_last_allocated_ptr + diff > 0))
		return bmap->b_last_allocated_ptr + diff;
	else
		return NILFS_BMAP_INVALID_PTR;
}

#define NILFS_BMAP_GROUP_DIV	8
__u64 nilfs_bmap_find_target_in_group(const struct nilfs_bmap *bmap)
{
	struct inode *dat = nilfs_bmap_get_dat(bmap);
	unsigned long entries_per_group = nilfs_palloc_entries_per_group(dat);
	unsigned long group = bmap->b_inode->i_ino / entries_per_group;

	return group * entries_per_group +
		(bmap->b_inode->i_ino % NILFS_BMAP_GROUP_DIV) *
		(entries_per_group / NILFS_BMAP_GROUP_DIV);
}

int nilfs_bmap_prepare_alloc_v(struct nilfs_bmap *bmap,
				 union nilfs_bmap_ptr_req *req)
{
	return nilfs_dat_prepare_alloc(nilfs_bmap_get_dat(bmap), &req->bpr_req);
}

void nilfs_bmap_commit_alloc_v(struct nilfs_bmap *bmap,
				 union nilfs_bmap_ptr_req *req)
{
	nilfs_dat_commit_alloc(nilfs_bmap_get_dat(bmap), &req->bpr_req);
}

void nilfs_bmap_abort_alloc_v(struct nilfs_bmap *bmap,
			      union nilfs_bmap_ptr_req *req)
{
	nilfs_dat_abort_alloc(nilfs_bmap_get_dat(bmap), &req->bpr_req);
}

int nilfs_bmap_start_v(struct nilfs_bmap *bmap, union nilfs_bmap_ptr_req *req,
		       sector_t blocknr)
{
	struct inode *dat = nilfs_bmap_get_dat(bmap);
	int ret;

	ret = nilfs_dat_prepare_start(dat, &req->bpr_req);
	if (likely(!ret))
		nilfs_dat_commit_start(dat, &req->bpr_req, blocknr);
	return ret;
}

int nilfs_bmap_prepare_end_v(struct nilfs_bmap *bmap,
			     union nilfs_bmap_ptr_req *req)
{
	return nilfs_dat_prepare_end(nilfs_bmap_get_dat(bmap), &req->bpr_req);
}

void nilfs_bmap_commit_end_v(struct nilfs_bmap *bmap,
			     union nilfs_bmap_ptr_req *req)
{
	nilfs_dat_commit_end(nilfs_bmap_get_dat(bmap), &req->bpr_req,
			     bmap->b_ptr_type == NILFS_BMAP_PTR_VS);
}

void nilfs_bmap_abort_end_v(struct nilfs_bmap *bmap,
			    union nilfs_bmap_ptr_req *req)
{
	nilfs_dat_abort_end(nilfs_bmap_get_dat(bmap), &req->bpr_req);
}

int nilfs_bmap_move_v(const struct nilfs_bmap *bmap, __u64 vblocknr,
		      sector_t blocknr)
{
	return nilfs_dat_move(nilfs_bmap_get_dat(bmap), vblocknr, blocknr);
}

int nilfs_bmap_mark_dirty(const struct nilfs_bmap *bmap, __u64 vblocknr)
{
	return nilfs_dat_mark_dirty(nilfs_bmap_get_dat(bmap), vblocknr);
}

int nilfs_bmap_prepare_update_v(struct nilfs_bmap *bmap,
				union nilfs_bmap_ptr_req *oldreq,
				union nilfs_bmap_ptr_req *newreq)
{
	struct inode *dat = nilfs_bmap_get_dat(bmap);
	int ret;

	ret = nilfs_dat_prepare_end(dat, &oldreq->bpr_req);
	if (ret < 0)
		return ret;
	ret = nilfs_dat_prepare_alloc(dat, &newreq->bpr_req);
	if (ret < 0)
		nilfs_dat_abort_end(dat, &oldreq->bpr_req);

	return ret;
}

void nilfs_bmap_commit_update_v(struct nilfs_bmap *bmap,
				union nilfs_bmap_ptr_req *oldreq,
				union nilfs_bmap_ptr_req *newreq)
{
	struct inode *dat = nilfs_bmap_get_dat(bmap);

	nilfs_dat_commit_end(dat, &oldreq->bpr_req,
			     bmap->b_ptr_type == NILFS_BMAP_PTR_VS);
	nilfs_dat_commit_alloc(dat, &newreq->bpr_req);
}

void nilfs_bmap_abort_update_v(struct nilfs_bmap *bmap,
			       union nilfs_bmap_ptr_req *oldreq,
			       union nilfs_bmap_ptr_req *newreq)
{
	struct inode *dat = nilfs_bmap_get_dat(bmap);

	nilfs_dat_abort_end(dat, &oldreq->bpr_req);
	nilfs_dat_abort_alloc(dat, &newreq->bpr_req);
}

static struct lock_class_key nilfs_bmap_dat_lock_key;
static struct lock_class_key nilfs_bmap_mdt_lock_key;

/**
 * nilfs_bmap_read - read a bmap from an inode
 * @bmap: bmap
 * @raw_inode: on-disk inode
 *
 * Description: nilfs_bmap_read() initializes the bmap @bmap.
 *
 * Return Value: On success, 0 is returned. On error, the following negative
 * error code is returned.
 *
 * %-ENOMEM - Insufficient amount of memory available.
 */
int nilfs_bmap_read(struct nilfs_bmap *bmap, struct nilfs_inode *raw_inode)
{
	if (raw_inode == NULL)
		memset(bmap->b_u.u_data, 0, NILFS_BMAP_SIZE);
	else
		memcpy(bmap->b_u.u_data, raw_inode->i_bmap, NILFS_BMAP_SIZE);

	init_rwsem(&bmap->b_sem);
	bmap->b_state = 0;
	bmap->b_inode = &NILFS_BMAP_I(bmap)->vfs_inode;
	switch (bmap->b_inode->i_ino) {
	case NILFS_DAT_INO:
		bmap->b_ptr_type = NILFS_BMAP_PTR_P;
		bmap->b_last_allocated_key = 0;
		bmap->b_last_allocated_ptr = NILFS_BMAP_NEW_PTR_INIT;
		lockdep_set_class(&bmap->b_sem, &nilfs_bmap_dat_lock_key);
		break;
	case NILFS_CPFILE_INO:
	case NILFS_SUFILE_INO:
		bmap->b_ptr_type = NILFS_BMAP_PTR_VS;
		bmap->b_last_allocated_key = 0;
		bmap->b_last_allocated_ptr = NILFS_BMAP_INVALID_PTR;
		lockdep_set_class(&bmap->b_sem, &nilfs_bmap_mdt_lock_key);
		break;
	case NILFS_IFILE_INO:
		lockdep_set_class(&bmap->b_sem, &nilfs_bmap_mdt_lock_key);
		/* Fall through */
	default:
		bmap->b_ptr_type = NILFS_BMAP_PTR_VM;
		bmap->b_last_allocated_key = 0;
		bmap->b_last_allocated_ptr = NILFS_BMAP_INVALID_PTR;
		break;
	}

	return (bmap->b_u.u_flags & NILFS_BMAP_LARGE) ?
		nilfs_btree_init(bmap) : nilfs_direct_init(bmap);
}

/**
 * nilfs_bmap_write - write back a bmap to an inode
 * @bmap: bmap
 * @raw_inode: on-disk inode
 *
 * Description: nilfs_bmap_write() stores @bmap in @raw_inode.
 */
void nilfs_bmap_write(struct nilfs_bmap *bmap, struct nilfs_inode *raw_inode)
{
	down_write(&bmap->b_sem);
	memcpy(raw_inode->i_bmap, bmap->b_u.u_data,
	       NILFS_INODE_BMAP_SIZE * sizeof(__le64));
	if (bmap->b_inode->i_ino == NILFS_DAT_INO)
		bmap->b_last_allocated_ptr = NILFS_BMAP_NEW_PTR_INIT;

	up_write(&bmap->b_sem);
}

void nilfs_bmap_init_gc(struct nilfs_bmap *bmap)
{
	memset(&bmap->b_u, 0, NILFS_BMAP_SIZE);
	init_rwsem(&bmap->b_sem);
	bmap->b_inode = &NILFS_BMAP_I(bmap)->vfs_inode;
	bmap->b_ptr_type = NILFS_BMAP_PTR_U;
	bmap->b_last_allocated_key = 0;
	bmap->b_last_allocated_ptr = NILFS_BMAP_INVALID_PTR;
	bmap->b_state = 0;
	nilfs_btree_init_gc(bmap);
}

void nilfs_bmap_init_gcdat(struct nilfs_bmap *gcbmap, struct nilfs_bmap *bmap)
{
	memcpy(gcbmap, bmap, sizeof(union nilfs_bmap_union));
	init_rwsem(&gcbmap->b_sem);
	lockdep_set_class(&bmap->b_sem, &nilfs_bmap_dat_lock_key);
	gcbmap->b_inode = &NILFS_BMAP_I(gcbmap)->vfs_inode;
}

void nilfs_bmap_commit_gcdat(struct nilfs_bmap *gcbmap, struct nilfs_bmap *bmap)
{
	memcpy(bmap, gcbmap, sizeof(union nilfs_bmap_union));
	init_rwsem(&bmap->b_sem);
	lockdep_set_class(&bmap->b_sem, &nilfs_bmap_dat_lock_key);
	bmap->b_inode = &NILFS_BMAP_I(bmap)->vfs_inode;
}
Commit	Line	Data
bdb265ea KS	1	/*
	2	* bmap.c - NILFS block mapping.
	3	*
	4	* Copyright (C) 2006-2008 Nippon Telegraph and Telephone Corporation.
	5	*
	6	* This program is free software; you can redistribute it and/or modify
	7	* it under the terms of the GNU General Public License as published by
	8	* the Free Software Foundation; either version 2 of the License, or
	9	* (at your option) any later version.
	10	*
	11	* This program is distributed in the hope that it will be useful,
	12	* but WITHOUT ANY WARRANTY; without even the implied warranty of
	13	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
	14	* GNU General Public License for more details.
	15	*
	16	* You should have received a copy of the GNU General Public License
	17	* along with this program; if not, write to the Free Software
	18	* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
	19	*
	20	* Written by Koji Sato <koji@osrg.net>.
	21	*/
	22
	23	#include <linux/fs.h>
	24	#include <linux/string.h>
	25	#include <linux/errno.h>
	26	#include "nilfs.h"
	27	#include "bmap.h"
	28	#include "sb.h"
	29	#include "btnode.h"
	30	#include "mdt.h"
	31	#include "dat.h"
	32	#include "alloc.h"
	33
c3a7abf0	34	struct inode nilfs_bmap_get_dat(const struct nilfs_bmap bmap)
d4b96157 RK	35	{
	36	return nilfs_dat_inode(NILFS_I_NILFS(bmap->b_inode));
	37	}
	38
bdb265ea KS	39	int nilfs_bmap_lookup_at_level(struct nilfs_bmap *bmap, __u64 key, int level,
	40	__u64 *ptrp)
	41	{
d4b96157	42	sector_t blocknr;
bdb265ea KS	43	int ret;
	44
	45	down_read(&bmap->b_sem);
8acfbf09	46	ret = bmap->b_ops->bop_lookup(bmap, key, level, ptrp);
bdb265ea KS	47	if (ret < 0)
bdb265ea KS	48	goto out;
d4b96157 RK	49	if (NILFS_BMAP_USE_VBN(bmap)) {
	50	ret = nilfs_dat_translate(nilfs_bmap_get_dat(bmap), *ptrp,
	51	&blocknr);
	52	if (!ret)
	53	*ptrp = blocknr;
bdb265ea KS	54	}
	55
	56	out:
	57	up_read(&bmap->b_sem);
	58	return ret;
	59	}
	60
c3a7abf0 RK	61	int nilfs_bmap_lookup_contig(struct nilfs_bmap bmap, __u64 key, __u64 ptrp,
	62	unsigned maxblocks)
	63	{
	64	int ret;
	65
	66	down_read(&bmap->b_sem);
	67	ret = bmap->b_ops->bop_lookup_contig(bmap, key, ptrp, maxblocks);
	68	up_read(&bmap->b_sem);
	69	return ret;
	70	}
bdb265ea KS	71
	72	/**
	73	* nilfs_bmap_lookup - find a record
	74	* @bmap: bmap
	75	* @key: key
	76	* @recp: pointer to record
	77	*
	78	* Description: nilfs_bmap_lookup() finds a record whose key matches @key in
	79	* @bmap.
	80	*
	81	* Return Value: On success, 0 is returned and the record associated with @key
	82	* is stored in the place pointed by @recp. On error, one of the following
	83	* negative error codes is returned.
	84	*
	85	* %-EIO - I/O error.
	86	*
	87	* %-ENOMEM - Insufficient amount of memory available.
	88	*
	89	* %-ENOENT - A record associated with @key does not exist.
	90	*/
	91	int nilfs_bmap_lookup(struct nilfs_bmap *bmap,
	92	unsigned long key,
	93	unsigned long *recp)
	94	{
	95	__u64 ptr;
	96	int ret;
	97
	98	/* XXX: use macro for level 1 */
	99	ret = nilfs_bmap_lookup_at_level(bmap, key, 1, &ptr);
	100	if (recp != NULL)
	101	*recp = ptr;
	102	return ret;
	103	}
	104
	105	static int nilfs_bmap_do_insert(struct nilfs_bmap *bmap, __u64 key, __u64 ptr)
	106	{
	107	__u64 keys[NILFS_BMAP_SMALL_HIGH + 1];
	108	__u64 ptrs[NILFS_BMAP_SMALL_HIGH + 1];
	109	int ret, n;
	110
	111	if (bmap->b_ops->bop_check_insert != NULL) {
8acfbf09	112	ret = bmap->b_ops->bop_check_insert(bmap, key);
bdb265ea	113	if (ret > 0) {
8acfbf09	114	n = bmap->b_ops->bop_gather_data(
bdb265ea KS	115	bmap, keys, ptrs, NILFS_BMAP_SMALL_HIGH + 1);
	116	if (n < 0)
	117	return n;
	118	ret = nilfs_btree_convert_and_insert(
3033342a	119	bmap, key, ptr, keys, ptrs, n);
bdb265ea KS	120	if (ret == 0)
	121	bmap->b_u.u_flags \|= NILFS_BMAP_LARGE;
	122
	123	return ret;
	124	} else if (ret < 0)
	125	return ret;
	126	}
	127
8acfbf09	128	return bmap->b_ops->bop_insert(bmap, key, ptr);
bdb265ea KS	129	}
	130
	131	/**
	132	* nilfs_bmap_insert - insert a new key-record pair into a bmap
	133	* @bmap: bmap
	134	* @key: key
	135	* @rec: record
	136	*
	137	* Description: nilfs_bmap_insert() inserts the new key-record pair specified
	138	* by @key and @rec into @bmap.
	139	*
	140	* Return Value: On success, 0 is returned. On error, one of the following
	141	* negative error codes is returned.
	142	*
	143	* %-EIO - I/O error.
	144	*
	145	* %-ENOMEM - Insufficient amount of memory available.
	146	*
	147	* %-EEXIST - A record associated with @key already exist.
	148	*/
	149	int nilfs_bmap_insert(struct nilfs_bmap *bmap,
	150	unsigned long key,
	151	unsigned long rec)
	152	{
	153	int ret;
	154
	155	down_write(&bmap->b_sem);
	156	ret = nilfs_bmap_do_insert(bmap, key, rec);
	157	up_write(&bmap->b_sem);
	158	return ret;
	159	}
	160
	161	static int nilfs_bmap_do_delete(struct nilfs_bmap *bmap, __u64 key)
	162	{
	163	__u64 keys[NILFS_BMAP_LARGE_LOW + 1];
	164	__u64 ptrs[NILFS_BMAP_LARGE_LOW + 1];
	165	int ret, n;
	166
	167	if (bmap->b_ops->bop_check_delete != NULL) {
8acfbf09	168	ret = bmap->b_ops->bop_check_delete(bmap, key);
bdb265ea	169	if (ret > 0) {
8acfbf09	170	n = bmap->b_ops->bop_gather_data(
bdb265ea KS	171	bmap, keys, ptrs, NILFS_BMAP_LARGE_LOW + 1);
	172	if (n < 0)
	173	return n;
	174	ret = nilfs_direct_delete_and_convert(
3033342a	175	bmap, key, keys, ptrs, n);
bdb265ea KS	176	if (ret == 0)
	177	bmap->b_u.u_flags &= ~NILFS_BMAP_LARGE;
	178
	179	return ret;
	180	} else if (ret < 0)
	181	return ret;
	182	}
	183
8acfbf09	184	return bmap->b_ops->bop_delete(bmap, key);
bdb265ea KS	185	}
	186
	187	int nilfs_bmap_last_key(struct nilfs_bmap bmap, unsigned long key)
	188	{
	189	__u64 lastkey;
	190	int ret;
	191
	192	down_read(&bmap->b_sem);
8acfbf09	193	ret = bmap->b_ops->bop_last_key(bmap, &lastkey);
bdb265ea KS	194	if (!ret)
	195	*key = lastkey;
	196	up_read(&bmap->b_sem);
	197	return ret;
	198	}
	199
	200	/**
	201	* nilfs_bmap_delete - delete a key-record pair from a bmap
	202	* @bmap: bmap
	203	* @key: key
	204	*
	205	* Description: nilfs_bmap_delete() deletes the key-record pair specified by
	206	* @key from @bmap.
	207	*
	208	* Return Value: On success, 0 is returned. On error, one of the following
	209	* negative error codes is returned.
	210	*
	211	* %-EIO - I/O error.
	212	*
	213	* %-ENOMEM - Insufficient amount of memory available.
	214	*
	215	* %-ENOENT - A record associated with @key does not exist.
	216	*/
	217	int nilfs_bmap_delete(struct nilfs_bmap *bmap, unsigned long key)
	218	{
	219	int ret;
	220
	221	down_write(&bmap->b_sem);
	222	ret = nilfs_bmap_do_delete(bmap, key);
	223	up_write(&bmap->b_sem);
	224	return ret;
	225	}
	226
	227	static int nilfs_bmap_do_truncate(struct nilfs_bmap *bmap, unsigned long key)
	228	{
	229	__u64 lastkey;
	230	int ret;
	231
8acfbf09	232	ret = bmap->b_ops->bop_last_key(bmap, &lastkey);
bdb265ea KS	233	if (ret < 0) {
	234	if (ret == -ENOENT)
	235	ret = 0;
	236	return ret;
	237	}
	238
	239	while (key <= lastkey) {
	240	ret = nilfs_bmap_do_delete(bmap, lastkey);
	241	if (ret < 0)
	242	return ret;
8acfbf09	243	ret = bmap->b_ops->bop_last_key(bmap, &lastkey);
bdb265ea KS	244	if (ret < 0) {
	245	if (ret == -ENOENT)
	246	ret = 0;
	247	return ret;
	248	}
	249	}
	250	return 0;
	251	}
	252
	253	/**
	254	* nilfs_bmap_truncate - truncate a bmap to a specified key
	255	* @bmap: bmap
	256	* @key: key
	257	*
	258	* Description: nilfs_bmap_truncate() removes key-record pairs whose keys are
	259	* greater than or equal to @key from @bmap.
	260	*
	261	* Return Value: On success, 0 is returned. On error, one of the following
	262	* negative error codes is returned.
	263	*
	264	* %-EIO - I/O error.
	265	*
	266	* %-ENOMEM - Insufficient amount of memory available.
	267	*/
	268	int nilfs_bmap_truncate(struct nilfs_bmap *bmap, unsigned long key)
	269	{
	270	int ret;
	271
	272	down_write(&bmap->b_sem);
	273	ret = nilfs_bmap_do_truncate(bmap, key);
	274	up_write(&bmap->b_sem);
	275	return ret;
	276	}
	277
	278	/**
	279	* nilfs_bmap_clear - free resources a bmap holds
	280	* @bmap: bmap
	281	*
	282	* Description: nilfs_bmap_clear() frees resources associated with @bmap.
	283	*/
	284	void nilfs_bmap_clear(struct nilfs_bmap *bmap)
	285	{
	286	down_write(&bmap->b_sem);
	287	if (bmap->b_ops->bop_clear != NULL)
8acfbf09	288	bmap->b_ops->bop_clear(bmap);
bdb265ea KS	289	up_write(&bmap->b_sem);
	290	}
	291
	292	/**
	293	* nilfs_bmap_propagate - propagate dirty state
	294	* @bmap: bmap
	295	* @bh: buffer head
	296	*
	297	* Description: nilfs_bmap_propagate() marks the buffers that directly or
	298	* indirectly refer to the block specified by @bh dirty.
	299	*
	300	* Return Value: On success, 0 is returned. On error, one of the following
	301	* negative error codes is returned.
	302	*
	303	* %-EIO - I/O error.
	304	*
	305	* %-ENOMEM - Insufficient amount of memory available.
	306	*/
	307	int nilfs_bmap_propagate(struct nilfs_bmap bmap, struct buffer_head bh)
	308	{
	309	int ret;
	310
	311	down_write(&bmap->b_sem);
8acfbf09	312	ret = bmap->b_ops->bop_propagate(bmap, bh);
bdb265ea KS	313	up_write(&bmap->b_sem);
	314	return ret;
	315	}
	316
	317	/**
	318	* nilfs_bmap_lookup_dirty_buffers -
	319	* @bmap: bmap
	320	* @listp: pointer to buffer head list
	321	*/
	322	void nilfs_bmap_lookup_dirty_buffers(struct nilfs_bmap *bmap,
	323	struct list_head *listp)
	324	{
	325	if (bmap->b_ops->bop_lookup_dirty_buffers != NULL)
8acfbf09	326	bmap->b_ops->bop_lookup_dirty_buffers(bmap, listp);
bdb265ea KS	327	}
	328
	329	/**
	330	* nilfs_bmap_assign - assign a new block number to a block
	331	* @bmap: bmap
	332	* @bhp: pointer to buffer head
	333	* @blocknr: block number
	334	* @binfo: block information
	335	*
	336	* Description: nilfs_bmap_assign() assigns the block number @blocknr to the
	337	* buffer specified by @bh.
	338	*
	339	* Return Value: On success, 0 is returned and the buffer head of a newly
	340	* create buffer and the block information associated with the buffer are
	341	* stored in the place pointed by @bh and @binfo, respectively. On error, one
	342	* of the following negative error codes is returned.
	343	*
	344	* %-EIO - I/O error.
	345	*
	346	* %-ENOMEM - Insufficient amount of memory available.
	347	*/
	348	int nilfs_bmap_assign(struct nilfs_bmap *bmap,
	349	struct buffer_head **bh,
	350	unsigned long blocknr,
	351	union nilfs_binfo *binfo)
	352	{
	353	int ret;
	354
	355	down_write(&bmap->b_sem);
8acfbf09	356	ret = bmap->b_ops->bop_assign(bmap, bh, blocknr, binfo);
bdb265ea KS	357	up_write(&bmap->b_sem);
	358	return ret;
	359	}
	360
	361	/**
	362	* nilfs_bmap_mark - mark block dirty
	363	* @bmap: bmap
	364	* @key: key
	365	* @level: level
	366	*
	367	* Description: nilfs_bmap_mark() marks the block specified by @key and @level
	368	* as dirty.
	369	*
	370	* Return Value: On success, 0 is returned. On error, one of the following
	371	* negative error codes is returned.
	372	*
	373	* %-EIO - I/O error.
	374	*
	375	* %-ENOMEM - Insufficient amount of memory available.
	376	*/
	377	int nilfs_bmap_mark(struct nilfs_bmap *bmap, __u64 key, int level)
	378	{
	379	int ret;
	380
	381	if (bmap->b_ops->bop_mark == NULL)
	382	return 0;
	383
	384	down_write(&bmap->b_sem);
8acfbf09	385	ret = bmap->b_ops->bop_mark(bmap, key, level);
bdb265ea KS	386	up_write(&bmap->b_sem);
	387	return ret;
	388	}
	389
	390	/**
	391	* nilfs_bmap_test_and_clear_dirty - test and clear a bmap dirty state
	392	* @bmap: bmap
	393	*
	394	* Description: nilfs_test_and_clear() is the atomic operation to test and
	395	* clear the dirty state of @bmap.
	396	*
	397	* Return Value: 1 is returned if @bmap is dirty, or 0 if clear.
	398	*/
	399	int nilfs_bmap_test_and_clear_dirty(struct nilfs_bmap *bmap)
	400	{
	401	int ret;
	402
	403	down_write(&bmap->b_sem);
	404	ret = nilfs_bmap_dirty(bmap);
	405	nilfs_bmap_clear_dirty(bmap);
	406	up_write(&bmap->b_sem);
	407	return ret;
	408	}
	409
	410
	411	/*
	412	* Internal use only
	413	*/
	414
	415	void nilfs_bmap_add_blocks(const struct nilfs_bmap *bmap, int n)
	416	{
	417	inode_add_bytes(bmap->b_inode, (1 << bmap->b_inode->i_blkbits) * n);
	418	if (NILFS_MDT(bmap->b_inode))
	419	nilfs_mdt_mark_dirty(bmap->b_inode);
	420	else
	421	mark_inode_dirty(bmap->b_inode);
	422	}
	423
	424	void nilfs_bmap_sub_blocks(const struct nilfs_bmap *bmap, int n)
	425	{
	426	inode_sub_bytes(bmap->b_inode, (1 << bmap->b_inode->i_blkbits) * n);
	427	if (NILFS_MDT(bmap->b_inode))
	428	nilfs_mdt_mark_dirty(bmap->b_inode);
	429	else
	430	mark_inode_dirty(bmap->b_inode);
	431	}
	432
bdb265ea KS	433	__u64 nilfs_bmap_data_get_key(const struct nilfs_bmap *bmap,
	434	const struct buffer_head *bh)
	435	{
	436	struct buffer_head *pbh;
	437	__u64 key;
	438
	439	key = page_index(bh->b_page) << (PAGE_CACHE_SHIFT -
	440	bmap->b_inode->i_blkbits);
	441	for (pbh = page_buffers(bh->b_page); pbh != bh;
	442	pbh = pbh->b_this_page, key++);
	443
	444	return key;
	445	}
	446
	447	__u64 nilfs_bmap_find_target_seq(const struct nilfs_bmap *bmap, __u64 key)
	448	{
	449	__s64 diff;
	450
	451	diff = key - bmap->b_last_allocated_key;
	452	if ((nilfs_bmap_keydiff_abs(diff) < NILFS_INODE_BMAP_SIZE) &&
	453	(bmap->b_last_allocated_ptr != NILFS_BMAP_INVALID_PTR) &&
	454	(bmap->b_last_allocated_ptr + diff > 0))
	455	return bmap->b_last_allocated_ptr + diff;
	456	else
	457	return NILFS_BMAP_INVALID_PTR;
	458	}
	459
bdb265ea KS	460	#define NILFS_BMAP_GROUP_DIV 8
	461	__u64 nilfs_bmap_find_target_in_group(const struct nilfs_bmap *bmap)
	462	{
	463	struct inode *dat = nilfs_bmap_get_dat(bmap);
	464	unsigned long entries_per_group = nilfs_palloc_entries_per_group(dat);
	465	unsigned long group = bmap->b_inode->i_ino / entries_per_group;
	466
	467	return group * entries_per_group +
	468	(bmap->b_inode->i_ino % NILFS_BMAP_GROUP_DIV) *
	469	(entries_per_group / NILFS_BMAP_GROUP_DIV);
	470	}
	471
d4b96157 RK	472	int nilfs_bmap_prepare_alloc_v(struct nilfs_bmap *bmap,
d4b96157 RK	473	union nilfs_bmap_ptr_req *req)
bdb265ea KS	474	{
	475	return nilfs_dat_prepare_alloc(nilfs_bmap_get_dat(bmap), &req->bpr_req);
	476	}
	477
d4b96157 RK	478	void nilfs_bmap_commit_alloc_v(struct nilfs_bmap *bmap,
d4b96157 RK	479	union nilfs_bmap_ptr_req *req)
bdb265ea KS	480	{
	481	nilfs_dat_commit_alloc(nilfs_bmap_get_dat(bmap), &req->bpr_req);
	482	}
	483
d4b96157 RK	484	void nilfs_bmap_abort_alloc_v(struct nilfs_bmap *bmap,
d4b96157 RK	485	union nilfs_bmap_ptr_req *req)
bdb265ea KS	486	{
	487	nilfs_dat_abort_alloc(nilfs_bmap_get_dat(bmap), &req->bpr_req);
	488	}
	489
d97a51a7 RK	490	int nilfs_bmap_start_v(struct nilfs_bmap bmap, union nilfs_bmap_ptr_req req,
d97a51a7 RK	491	sector_t blocknr)
bdb265ea	492	{
d97a51a7 RK	493	struct inode *dat = nilfs_bmap_get_dat(bmap);
d97a51a7 RK	494	int ret;
bdb265ea	495
d97a51a7 RK	496	ret = nilfs_dat_prepare_start(dat, &req->bpr_req);
	497	if (likely(!ret))
	498	nilfs_dat_commit_start(dat, &req->bpr_req, blocknr);
	499	return ret;
bdb265ea KS	500	}
bdb265ea KS	501
d4b96157 RK	502	int nilfs_bmap_prepare_end_v(struct nilfs_bmap *bmap,
d4b96157 RK	503	union nilfs_bmap_ptr_req *req)
bdb265ea KS	504	{
	505	return nilfs_dat_prepare_end(nilfs_bmap_get_dat(bmap), &req->bpr_req);
	506	}
	507
d4b96157 RK	508	void nilfs_bmap_commit_end_v(struct nilfs_bmap *bmap,
d4b96157 RK	509	union nilfs_bmap_ptr_req *req)
bdb265ea	510	{
d4b96157 RK	511	nilfs_dat_commit_end(nilfs_bmap_get_dat(bmap), &req->bpr_req,
d4b96157 RK	512	bmap->b_ptr_type == NILFS_BMAP_PTR_VS);
bdb265ea KS	513	}
bdb265ea KS	514
d4b96157 RK	515	void nilfs_bmap_abort_end_v(struct nilfs_bmap *bmap,
d4b96157 RK	516	union nilfs_bmap_ptr_req *req)
bdb265ea KS	517	{
	518	nilfs_dat_abort_end(nilfs_bmap_get_dat(bmap), &req->bpr_req);
	519	}
	520
	521	int nilfs_bmap_move_v(const struct nilfs_bmap *bmap, __u64 vblocknr,
	522	sector_t blocknr)
	523	{
	524	return nilfs_dat_move(nilfs_bmap_get_dat(bmap), vblocknr, blocknr);
	525	}
	526
	527	int nilfs_bmap_mark_dirty(const struct nilfs_bmap *bmap, __u64 vblocknr)
	528	{
	529	return nilfs_dat_mark_dirty(nilfs_bmap_get_dat(bmap), vblocknr);
	530	}
	531
d4b96157 RK	532	int nilfs_bmap_prepare_update_v(struct nilfs_bmap *bmap,
	533	union nilfs_bmap_ptr_req *oldreq,
	534	union nilfs_bmap_ptr_req *newreq)
bdb265ea	535	{
d4b96157	536	struct inode *dat = nilfs_bmap_get_dat(bmap);
bdb265ea KS	537	int ret;
bdb265ea KS	538
d4b96157	539	ret = nilfs_dat_prepare_end(dat, &oldreq->bpr_req);
bdb265ea KS	540	if (ret < 0)
bdb265ea KS	541	return ret;
d4b96157	542	ret = nilfs_dat_prepare_alloc(dat, &newreq->bpr_req);
bdb265ea	543	if (ret < 0)
d4b96157	544	nilfs_dat_abort_end(dat, &oldreq->bpr_req);
bdb265ea KS	545
	546	return ret;
	547	}
	548
d4b96157 RK	549	void nilfs_bmap_commit_update_v(struct nilfs_bmap *bmap,
	550	union nilfs_bmap_ptr_req *oldreq,
	551	union nilfs_bmap_ptr_req *newreq)
bdb265ea	552	{
d4b96157	553	struct inode *dat = nilfs_bmap_get_dat(bmap);
bdb265ea	554
d4b96157 RK	555	nilfs_dat_commit_end(dat, &oldreq->bpr_req,
	556	bmap->b_ptr_type == NILFS_BMAP_PTR_VS);
	557	nilfs_dat_commit_alloc(dat, &newreq->bpr_req);
bdb265ea KS	558	}
bdb265ea KS	559
d4b96157 RK	560	void nilfs_bmap_abort_update_v(struct nilfs_bmap *bmap,
	561	union nilfs_bmap_ptr_req *oldreq,
	562	union nilfs_bmap_ptr_req *newreq)
bdb265ea	563	{
d4b96157	564	struct inode *dat = nilfs_bmap_get_dat(bmap);
bdb265ea	565
d4b96157 RK	566	nilfs_dat_abort_end(dat, &oldreq->bpr_req);
d4b96157 RK	567	nilfs_dat_abort_alloc(dat, &newreq->bpr_req);
bdb265ea KS	568	}
bdb265ea KS	569
bcb48891	570	static struct lock_class_key nilfs_bmap_dat_lock_key;
ff54de36	571	static struct lock_class_key nilfs_bmap_mdt_lock_key;
bcb48891	572
bdb265ea KS	573	/**
	574	* nilfs_bmap_read - read a bmap from an inode
	575	* @bmap: bmap
	576	* @raw_inode: on-disk inode
	577	*
	578	* Description: nilfs_bmap_read() initializes the bmap @bmap.
	579	*
	580	* Return Value: On success, 0 is returned. On error, the following negative
	581	* error code is returned.
	582	*
	583	* %-ENOMEM - Insufficient amount of memory available.
	584	*/
	585	int nilfs_bmap_read(struct nilfs_bmap bmap, struct nilfs_inode raw_inode)
	586	{
	587	if (raw_inode == NULL)
	588	memset(bmap->b_u.u_data, 0, NILFS_BMAP_SIZE);
	589	else
	590	memcpy(bmap->b_u.u_data, raw_inode->i_bmap, NILFS_BMAP_SIZE);
	591
	592	init_rwsem(&bmap->b_sem);
	593	bmap->b_state = 0;
	594	bmap->b_inode = &NILFS_BMAP_I(bmap)->vfs_inode;
	595	switch (bmap->b_inode->i_ino) {
	596	case NILFS_DAT_INO:
d4b96157 RK	597	bmap->b_ptr_type = NILFS_BMAP_PTR_P;
d4b96157 RK	598	bmap->b_last_allocated_key = 0;
bdb265ea	599	bmap->b_last_allocated_ptr = NILFS_BMAP_NEW_PTR_INIT;
bcb48891	600	lockdep_set_class(&bmap->b_sem, &nilfs_bmap_dat_lock_key);
bdb265ea KS	601	break;
	602	case NILFS_CPFILE_INO:
	603	case NILFS_SUFILE_INO:
d4b96157 RK	604	bmap->b_ptr_type = NILFS_BMAP_PTR_VS;
d4b96157 RK	605	bmap->b_last_allocated_key = 0;
bdb265ea	606	bmap->b_last_allocated_ptr = NILFS_BMAP_INVALID_PTR;
ff54de36	607	lockdep_set_class(&bmap->b_sem, &nilfs_bmap_mdt_lock_key);
bdb265ea	608	break;
ff54de36 RK	609	case NILFS_IFILE_INO:
	610	lockdep_set_class(&bmap->b_sem, &nilfs_bmap_mdt_lock_key);
	611	/* Fall through */
bdb265ea	612	default:
d4b96157 RK	613	bmap->b_ptr_type = NILFS_BMAP_PTR_VM;
d4b96157 RK	614	bmap->b_last_allocated_key = 0;
bdb265ea KS	615	bmap->b_last_allocated_ptr = NILFS_BMAP_INVALID_PTR;
	616	break;
	617	}
	618
	619	return (bmap->b_u.u_flags & NILFS_BMAP_LARGE) ?
3033342a	620	nilfs_btree_init(bmap) : nilfs_direct_init(bmap);
bdb265ea KS	621	}
	622
	623	/**
	624	* nilfs_bmap_write - write back a bmap to an inode
	625	* @bmap: bmap
	626	* @raw_inode: on-disk inode
	627	*
	628	* Description: nilfs_bmap_write() stores @bmap in @raw_inode.
	629	*/
	630	void nilfs_bmap_write(struct nilfs_bmap bmap, struct nilfs_inode raw_inode)
	631	{
	632	down_write(&bmap->b_sem);
	633	memcpy(raw_inode->i_bmap, bmap->b_u.u_data,
	634	NILFS_INODE_BMAP_SIZE * sizeof(__le64));
	635	if (bmap->b_inode->i_ino == NILFS_DAT_INO)
	636	bmap->b_last_allocated_ptr = NILFS_BMAP_NEW_PTR_INIT;
	637
	638	up_write(&bmap->b_sem);
	639	}
	640
	641	void nilfs_bmap_init_gc(struct nilfs_bmap *bmap)
	642	{
	643	memset(&bmap->b_u, 0, NILFS_BMAP_SIZE);
	644	init_rwsem(&bmap->b_sem);
	645	bmap->b_inode = &NILFS_BMAP_I(bmap)->vfs_inode;
d4b96157	646	bmap->b_ptr_type = NILFS_BMAP_PTR_U;
bdb265ea KS	647	bmap->b_last_allocated_key = 0;
	648	bmap->b_last_allocated_ptr = NILFS_BMAP_INVALID_PTR;
	649	bmap->b_state = 0;
	650	nilfs_btree_init_gc(bmap);
	651	}
	652
	653	void nilfs_bmap_init_gcdat(struct nilfs_bmap gcbmap, struct nilfs_bmap bmap)
	654	{
	655	memcpy(gcbmap, bmap, sizeof(union nilfs_bmap_union));
	656	init_rwsem(&gcbmap->b_sem);
bcb48891	657	lockdep_set_class(&bmap->b_sem, &nilfs_bmap_dat_lock_key);
bdb265ea KS	658	gcbmap->b_inode = &NILFS_BMAP_I(gcbmap)->vfs_inode;
	659	}
	660
	661	void nilfs_bmap_commit_gcdat(struct nilfs_bmap gcbmap, struct nilfs_bmap bmap)
	662	{
	663	memcpy(bmap, gcbmap, sizeof(union nilfs_bmap_union));
	664	init_rwsem(&bmap->b_sem);
bcb48891	665	lockdep_set_class(&bmap->b_sem, &nilfs_bmap_dat_lock_key);
bdb265ea KS	666	bmap->b_inode = &NILFS_BMAP_I(bmap)->vfs_inode;
bdb265ea KS	667	}