[linux-2.6-block.git] / fs / nilfs2 / direct.c

/*
 * direct.c - NILFS direct block pointer.
 *
 * 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/errno.h>
#include "nilfs.h"
#include "page.h"
#include "direct.h"
#include "alloc.h"
#include "dat.h"

static inline __le64 *nilfs_direct_dptrs(const struct nilfs_bmap *direct)
{
	return (__le64 *)
		((struct nilfs_direct_node *)direct->b_u.u_data + 1);
}

static inline __u64
nilfs_direct_get_ptr(const struct nilfs_bmap *direct, __u64 key)
{
	return le64_to_cpu(*(nilfs_direct_dptrs(direct) + key));
}

static inline void nilfs_direct_set_ptr(struct nilfs_bmap *direct,
					__u64 key, __u64 ptr)
{
	*(nilfs_direct_dptrs(direct) + key) = cpu_to_le64(ptr);
}

static int nilfs_direct_lookup(const struct nilfs_bmap *direct,
			       __u64 key, int level, __u64 *ptrp)
{
	__u64 ptr;

	if (key > NILFS_DIRECT_KEY_MAX || level != 1)
		return -ENOENT;
	ptr = nilfs_direct_get_ptr(direct, key);
	if (ptr == NILFS_BMAP_INVALID_PTR)
		return -ENOENT;

	*ptrp = ptr;
	return 0;
}

static int nilfs_direct_lookup_contig(const struct nilfs_bmap *direct,
				      __u64 key, __u64 *ptrp,
				      unsigned maxblocks)
{
	struct inode *dat = NULL;
	__u64 ptr, ptr2;
	sector_t blocknr;
	int ret, cnt;

	if (key > NILFS_DIRECT_KEY_MAX)
		return -ENOENT;
	ptr = nilfs_direct_get_ptr(direct, key);
	if (ptr == NILFS_BMAP_INVALID_PTR)
		return -ENOENT;

	if (NILFS_BMAP_USE_VBN(direct)) {
		dat = nilfs_bmap_get_dat(direct);
		ret = nilfs_dat_translate(dat, ptr, &blocknr);
		if (ret < 0)
			return ret;
		ptr = blocknr;
	}

	maxblocks = min_t(unsigned, maxblocks, NILFS_DIRECT_KEY_MAX - key + 1);
	for (cnt = 1; cnt < maxblocks &&
		     (ptr2 = nilfs_direct_get_ptr(direct, key + cnt)) !=
		     NILFS_BMAP_INVALID_PTR;
	     cnt++) {
		if (dat) {
			ret = nilfs_dat_translate(dat, ptr2, &blocknr);
			if (ret < 0)
				return ret;
			ptr2 = blocknr;
		}
		if (ptr2 != ptr + cnt)
			break;
	}
	*ptrp = ptr;
	return cnt;
}

static __u64
nilfs_direct_find_target_v(const struct nilfs_bmap *direct, __u64 key)
{
	__u64 ptr;

	ptr = nilfs_bmap_find_target_seq(direct, key);
	if (ptr != NILFS_BMAP_INVALID_PTR)
		/* sequential access */
		return ptr;
	else
		/* block group */
		return nilfs_bmap_find_target_in_group(direct);
}

static int nilfs_direct_insert(struct nilfs_bmap *bmap, __u64 key, __u64 ptr)
{
	union nilfs_bmap_ptr_req req;
	struct inode *dat = NULL;
	struct buffer_head *bh;
	int ret;

	if (key > NILFS_DIRECT_KEY_MAX)
		return -ENOENT;
	if (nilfs_direct_get_ptr(bmap, key) != NILFS_BMAP_INVALID_PTR)
		return -EEXIST;

	if (NILFS_BMAP_USE_VBN(bmap)) {
		req.bpr_ptr = nilfs_direct_find_target_v(bmap, key);
		dat = nilfs_bmap_get_dat(bmap);
	}
	ret = nilfs_bmap_prepare_alloc_ptr(bmap, &req, dat);
	if (!ret) {
		/* ptr must be a pointer to a buffer head. */
		bh = (struct buffer_head *)((unsigned long)ptr);
		set_buffer_nilfs_volatile(bh);

		nilfs_bmap_commit_alloc_ptr(bmap, &req, dat);
		nilfs_direct_set_ptr(bmap, key, req.bpr_ptr);

		if (!nilfs_bmap_dirty(bmap))
			nilfs_bmap_set_dirty(bmap);

		if (NILFS_BMAP_USE_VBN(bmap))
			nilfs_bmap_set_target_v(bmap, key, req.bpr_ptr);

		nilfs_inode_add_blocks(bmap->b_inode, 1);
	}
	return ret;
}

static int nilfs_direct_delete(struct nilfs_bmap *bmap, __u64 key)
{
	union nilfs_bmap_ptr_req req;
	struct inode *dat;
	int ret;

	if (key > NILFS_DIRECT_KEY_MAX ||
	    nilfs_direct_get_ptr(bmap, key) == NILFS_BMAP_INVALID_PTR)
		return -ENOENT;

	dat = NILFS_BMAP_USE_VBN(bmap) ? nilfs_bmap_get_dat(bmap) : NULL;
	req.bpr_ptr = nilfs_direct_get_ptr(bmap, key);

	ret = nilfs_bmap_prepare_end_ptr(bmap, &req, dat);
	if (!ret) {
		nilfs_bmap_commit_end_ptr(bmap, &req, dat);
		nilfs_direct_set_ptr(bmap, key, NILFS_BMAP_INVALID_PTR);
		nilfs_inode_sub_blocks(bmap->b_inode, 1);
	}
	return ret;
}

static int nilfs_direct_seek_key(const struct nilfs_bmap *direct, __u64 start,
				 __u64 *keyp)
{
	__u64 key;

	for (key = start; key <= NILFS_DIRECT_KEY_MAX; key++) {
		if (nilfs_direct_get_ptr(direct, key) !=
		    NILFS_BMAP_INVALID_PTR) {
			*keyp = key;
			return 0;
		}
	}
	return -ENOENT;
}

static int nilfs_direct_last_key(const struct nilfs_bmap *direct, __u64 *keyp)
{
	__u64 key, lastkey;

	lastkey = NILFS_DIRECT_KEY_MAX + 1;
	for (key = NILFS_DIRECT_KEY_MIN; key <= NILFS_DIRECT_KEY_MAX; key++)
		if (nilfs_direct_get_ptr(direct, key) !=
		    NILFS_BMAP_INVALID_PTR)
			lastkey = key;

	if (lastkey == NILFS_DIRECT_KEY_MAX + 1)
		return -ENOENT;

	*keyp = lastkey;

	return 0;
}

static int nilfs_direct_check_insert(const struct nilfs_bmap *bmap, __u64 key)
{
	return key > NILFS_DIRECT_KEY_MAX;
}

static int nilfs_direct_gather_data(struct nilfs_bmap *direct,
				    __u64 *keys, __u64 *ptrs, int nitems)
{
	__u64 key;
	__u64 ptr;
	int n;

	if (nitems > NILFS_DIRECT_NBLOCKS)
		nitems = NILFS_DIRECT_NBLOCKS;
	n = 0;
	for (key = 0; key < nitems; key++) {
		ptr = nilfs_direct_get_ptr(direct, key);
		if (ptr != NILFS_BMAP_INVALID_PTR) {
			keys[n] = key;
			ptrs[n] = ptr;
			n++;
		}
	}
	return n;
}

int nilfs_direct_delete_and_convert(struct nilfs_bmap *bmap,
				    __u64 key, __u64 *keys, __u64 *ptrs, int n)
{
	__le64 *dptrs;
	int ret, i, j;

	/* no need to allocate any resource for conversion */

	/* delete */
	ret = bmap->b_ops->bop_delete(bmap, key);
	if (ret < 0)
		return ret;

	/* free resources */
	if (bmap->b_ops->bop_clear != NULL)
		bmap->b_ops->bop_clear(bmap);

	/* convert */
	dptrs = nilfs_direct_dptrs(bmap);
	for (i = 0, j = 0; i < NILFS_DIRECT_NBLOCKS; i++) {
		if ((j < n) && (i == keys[j])) {
			dptrs[i] = (i != key) ?
				cpu_to_le64(ptrs[j]) :
				NILFS_BMAP_INVALID_PTR;
			j++;
		} else
			dptrs[i] = NILFS_BMAP_INVALID_PTR;
	}

	nilfs_direct_init(bmap);
	return 0;
}

static int nilfs_direct_propagate(struct nilfs_bmap *bmap,
				  struct buffer_head *bh)
{
	struct nilfs_palloc_req oldreq, newreq;
	struct inode *dat;
	__u64 key;
	__u64 ptr;
	int ret;

	if (!NILFS_BMAP_USE_VBN(bmap))
		return 0;

	dat = nilfs_bmap_get_dat(bmap);
	key = nilfs_bmap_data_get_key(bmap, bh);
	ptr = nilfs_direct_get_ptr(bmap, key);
	if (!buffer_nilfs_volatile(bh)) {
		oldreq.pr_entry_nr = ptr;
		newreq.pr_entry_nr = ptr;
		ret = nilfs_dat_prepare_update(dat, &oldreq, &newreq);
		if (ret < 0)
			return ret;
		nilfs_dat_commit_update(dat, &oldreq, &newreq,
					bmap->b_ptr_type == NILFS_BMAP_PTR_VS);
		set_buffer_nilfs_volatile(bh);
		nilfs_direct_set_ptr(bmap, key, newreq.pr_entry_nr);
	} else
		ret = nilfs_dat_mark_dirty(dat, ptr);

	return ret;
}

static int nilfs_direct_assign_v(struct nilfs_bmap *direct,
				 __u64 key, __u64 ptr,
				 struct buffer_head **bh,
				 sector_t blocknr,
				 union nilfs_binfo *binfo)
{
	struct inode *dat = nilfs_bmap_get_dat(direct);
	union nilfs_bmap_ptr_req req;
	int ret;

	req.bpr_ptr = ptr;
	ret = nilfs_dat_prepare_start(dat, &req.bpr_req);
	if (!ret) {
		nilfs_dat_commit_start(dat, &req.bpr_req, blocknr);
		binfo->bi_v.bi_vblocknr = cpu_to_le64(ptr);
		binfo->bi_v.bi_blkoff = cpu_to_le64(key);
	}
	return ret;
}

static int nilfs_direct_assign_p(struct nilfs_bmap *direct,
				 __u64 key, __u64 ptr,
				 struct buffer_head **bh,
				 sector_t blocknr,
				 union nilfs_binfo *binfo)
{
	nilfs_direct_set_ptr(direct, key, blocknr);

	binfo->bi_dat.bi_blkoff = cpu_to_le64(key);
	binfo->bi_dat.bi_level = 0;

	return 0;
}

static int nilfs_direct_assign(struct nilfs_bmap *bmap,
			       struct buffer_head **bh,
			       sector_t blocknr,
			       union nilfs_binfo *binfo)
{
	__u64 key;
	__u64 ptr;

	key = nilfs_bmap_data_get_key(bmap, *bh);
	if (unlikely(key > NILFS_DIRECT_KEY_MAX)) {
		printk(KERN_CRIT "%s: invalid key: %llu\n", __func__,
		       (unsigned long long)key);
		return -EINVAL;
	}
	ptr = nilfs_direct_get_ptr(bmap, key);
	if (unlikely(ptr == NILFS_BMAP_INVALID_PTR)) {
		printk(KERN_CRIT "%s: invalid pointer: %llu\n", __func__,
		       (unsigned long long)ptr);
		return -EINVAL;
	}

	return NILFS_BMAP_USE_VBN(bmap) ?
		nilfs_direct_assign_v(bmap, key, ptr, bh, blocknr, binfo) :
		nilfs_direct_assign_p(bmap, key, ptr, bh, blocknr, binfo);
}

static const struct nilfs_bmap_operations nilfs_direct_ops = {
	.bop_lookup		=	nilfs_direct_lookup,
	.bop_lookup_contig	=	nilfs_direct_lookup_contig,
	.bop_insert		=	nilfs_direct_insert,
	.bop_delete		=	nilfs_direct_delete,
	.bop_clear		=	NULL,

	.bop_propagate		=	nilfs_direct_propagate,

	.bop_lookup_dirty_buffers	=	NULL,

	.bop_assign		=	nilfs_direct_assign,
	.bop_mark		=	NULL,

	.bop_seek_key		=	nilfs_direct_seek_key,
	.bop_last_key		=	nilfs_direct_last_key,

	.bop_check_insert	=	nilfs_direct_check_insert,
	.bop_check_delete	=	NULL,
	.bop_gather_data	=	nilfs_direct_gather_data,
};


int nilfs_direct_init(struct nilfs_bmap *bmap)
{
	bmap->b_ops = &nilfs_direct_ops;
	return 0;
}
Commit	Line	Data
36a580eb KS	1	/*
	2	* direct.c - NILFS direct block pointer.
	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/errno.h>
	24	#include "nilfs.h"
	25	#include "page.h"
	26	#include "direct.h"
	27	#include "alloc.h"
c3a7abf0	28	#include "dat.h"
36a580eb	29
10ff885b	30	static inline __le64 nilfs_direct_dptrs(const struct nilfs_bmap direct)
36a580eb KS	31	{
36a580eb KS	32	return (__le64 *)
10ff885b	33	((struct nilfs_direct_node *)direct->b_u.u_data + 1);
36a580eb KS	34	}
	35
	36	static inline __u64
10ff885b	37	nilfs_direct_get_ptr(const struct nilfs_bmap *direct, __u64 key)
36a580eb	38	{
25b8d7de	39	return le64_to_cpu(*(nilfs_direct_dptrs(direct) + key));
36a580eb KS	40	}
36a580eb KS	41
10ff885b	42	static inline void nilfs_direct_set_ptr(struct nilfs_bmap *direct,
36a580eb KS	43	__u64 key, __u64 ptr)
36a580eb KS	44	{
25b8d7de	45	*(nilfs_direct_dptrs(direct) + key) = cpu_to_le64(ptr);
36a580eb KS	46	}
36a580eb KS	47
10ff885b	48	static int nilfs_direct_lookup(const struct nilfs_bmap *direct,
36a580eb KS	49	__u64 key, int level, __u64 *ptrp)
36a580eb KS	50	{
36a580eb KS	51	__u64 ptr;
36a580eb KS	52
5ee58148 JS	53	if (key > NILFS_DIRECT_KEY_MAX \|\| level != 1)
	54	return -ENOENT;
	55	ptr = nilfs_direct_get_ptr(direct, key);
	56	if (ptr == NILFS_BMAP_INVALID_PTR)
36a580eb KS	57	return -ENOENT;
36a580eb KS	58
364ec2d7	59	*ptrp = ptr;
36a580eb KS	60	return 0;
	61	}
	62
10ff885b	63	static int nilfs_direct_lookup_contig(const struct nilfs_bmap *direct,
c3a7abf0 RK	64	__u64 key, __u64 *ptrp,
	65	unsigned maxblocks)
	66	{
c3a7abf0 RK	67	struct inode *dat = NULL;
	68	__u64 ptr, ptr2;
	69	sector_t blocknr;
	70	int ret, cnt;
	71
5ee58148 JS	72	if (key > NILFS_DIRECT_KEY_MAX)
	73	return -ENOENT;
	74	ptr = nilfs_direct_get_ptr(direct, key);
	75	if (ptr == NILFS_BMAP_INVALID_PTR)
c3a7abf0 RK	76	return -ENOENT;
c3a7abf0 RK	77
10ff885b RK	78	if (NILFS_BMAP_USE_VBN(direct)) {
10ff885b RK	79	dat = nilfs_bmap_get_dat(direct);
c3a7abf0 RK	80	ret = nilfs_dat_translate(dat, ptr, &blocknr);
	81	if (ret < 0)
	82	return ret;
	83	ptr = blocknr;
	84	}
	85
	86	maxblocks = min_t(unsigned, maxblocks, NILFS_DIRECT_KEY_MAX - key + 1);
	87	for (cnt = 1; cnt < maxblocks &&
	88	(ptr2 = nilfs_direct_get_ptr(direct, key + cnt)) !=
	89	NILFS_BMAP_INVALID_PTR;
	90	cnt++) {
	91	if (dat) {
	92	ret = nilfs_dat_translate(dat, ptr2, &blocknr);
	93	if (ret < 0)
	94	return ret;
	95	ptr2 = blocknr;
	96	}
	97	if (ptr2 != ptr + cnt)
	98	break;
	99	}
	100	*ptrp = ptr;
	101	return cnt;
	102	}
	103
36a580eb	104	static __u64
10ff885b	105	nilfs_direct_find_target_v(const struct nilfs_bmap *direct, __u64 key)
36a580eb KS	106	{
	107	__u64 ptr;
	108
10ff885b	109	ptr = nilfs_bmap_find_target_seq(direct, key);
36a580eb KS	110	if (ptr != NILFS_BMAP_INVALID_PTR)
	111	/* sequential access */
	112	return ptr;
	113	else
	114	/* block group */
10ff885b	115	return nilfs_bmap_find_target_in_group(direct);
36a580eb KS	116	}
36a580eb KS	117
36a580eb KS	118	static int nilfs_direct_insert(struct nilfs_bmap *bmap, __u64 key, __u64 ptr)
36a580eb KS	119	{
36a580eb	120	union nilfs_bmap_ptr_req req;
2e0c2c73 RK	121	struct inode *dat = NULL;
2e0c2c73 RK	122	struct buffer_head *bh;
36a580eb KS	123	int ret;
36a580eb KS	124
36a580eb KS	125	if (key > NILFS_DIRECT_KEY_MAX)
36a580eb KS	126	return -ENOENT;
10ff885b	127	if (nilfs_direct_get_ptr(bmap, key) != NILFS_BMAP_INVALID_PTR)
36a580eb KS	128	return -EEXIST;
36a580eb KS	129
2e0c2c73	130	if (NILFS_BMAP_USE_VBN(bmap)) {
10ff885b	131	req.bpr_ptr = nilfs_direct_find_target_v(bmap, key);
2e0c2c73 RK	132	dat = nilfs_bmap_get_dat(bmap);
	133	}
	134	ret = nilfs_bmap_prepare_alloc_ptr(bmap, &req, dat);
	135	if (!ret) {
	136	/* ptr must be a pointer to a buffer head. */
	137	bh = (struct buffer_head *)((unsigned long)ptr);
	138	set_buffer_nilfs_volatile(bh);
36a580eb	139
2e0c2c73	140	nilfs_bmap_commit_alloc_ptr(bmap, &req, dat);
10ff885b	141	nilfs_direct_set_ptr(bmap, key, req.bpr_ptr);
36a580eb	142
2e0c2c73 RK	143	if (!nilfs_bmap_dirty(bmap))
2e0c2c73 RK	144	nilfs_bmap_set_dirty(bmap);
36a580eb	145
2e0c2c73	146	if (NILFS_BMAP_USE_VBN(bmap))
dc935be2	147	nilfs_bmap_set_target_v(bmap, key, req.bpr_ptr);
36a580eb	148
be667377	149	nilfs_inode_add_blocks(bmap->b_inode, 1);
2e0c2c73 RK	150	}
2e0c2c73 RK	151	return ret;
36a580eb KS	152	}
	153
	154	static int nilfs_direct_delete(struct nilfs_bmap *bmap, __u64 key)
	155	{
36a580eb	156	union nilfs_bmap_ptr_req req;
2e0c2c73	157	struct inode *dat;
36a580eb KS	158	int ret;
36a580eb KS	159
2e0c2c73	160	if (key > NILFS_DIRECT_KEY_MAX \|\|
10ff885b	161	nilfs_direct_get_ptr(bmap, key) == NILFS_BMAP_INVALID_PTR)
36a580eb KS	162	return -ENOENT;
36a580eb KS	163
2e0c2c73	164	dat = NILFS_BMAP_USE_VBN(bmap) ? nilfs_bmap_get_dat(bmap) : NULL;
10ff885b	165	req.bpr_ptr = nilfs_direct_get_ptr(bmap, key);
36a580eb	166
2e0c2c73 RK	167	ret = nilfs_bmap_prepare_end_ptr(bmap, &req, dat);
	168	if (!ret) {
	169	nilfs_bmap_commit_end_ptr(bmap, &req, dat);
10ff885b	170	nilfs_direct_set_ptr(bmap, key, NILFS_BMAP_INVALID_PTR);
be667377	171	nilfs_inode_sub_blocks(bmap->b_inode, 1);
2e0c2c73 RK	172	}
2e0c2c73 RK	173	return ret;
36a580eb KS	174	}
36a580eb KS	175
5b20384f RK	176	static int nilfs_direct_seek_key(const struct nilfs_bmap *direct, __u64 start,
	177	__u64 *keyp)
	178	{
	179	__u64 key;
	180
	181	for (key = start; key <= NILFS_DIRECT_KEY_MAX; key++) {
	182	if (nilfs_direct_get_ptr(direct, key) !=
	183	NILFS_BMAP_INVALID_PTR) {
	184	*keyp = key;
	185	return 0;
	186	}
	187	}
	188	return -ENOENT;
	189	}
	190
10ff885b	191	static int nilfs_direct_last_key(const struct nilfs_bmap direct, __u64 keyp)
36a580eb	192	{
36a580eb KS	193	__u64 key, lastkey;
36a580eb KS	194
36a580eb KS	195	lastkey = NILFS_DIRECT_KEY_MAX + 1;
	196	for (key = NILFS_DIRECT_KEY_MIN; key <= NILFS_DIRECT_KEY_MAX; key++)
	197	if (nilfs_direct_get_ptr(direct, key) !=
	198	NILFS_BMAP_INVALID_PTR)
	199	lastkey = key;
	200
	201	if (lastkey == NILFS_DIRECT_KEY_MAX + 1)
	202	return -ENOENT;
	203
36a580eb KS	204	*keyp = lastkey;
	205
	206	return 0;
	207	}
	208
	209	static int nilfs_direct_check_insert(const struct nilfs_bmap *bmap, __u64 key)
	210	{
	211	return key > NILFS_DIRECT_KEY_MAX;
	212	}
	213
10ff885b	214	static int nilfs_direct_gather_data(struct nilfs_bmap *direct,
36a580eb KS	215	__u64 keys, __u64 ptrs, int nitems)
36a580eb KS	216	{
36a580eb KS	217	__u64 key;
	218	__u64 ptr;
	219	int n;
	220
36a580eb KS	221	if (nitems > NILFS_DIRECT_NBLOCKS)
	222	nitems = NILFS_DIRECT_NBLOCKS;
	223	n = 0;
	224	for (key = 0; key < nitems; key++) {
	225	ptr = nilfs_direct_get_ptr(direct, key);
	226	if (ptr != NILFS_BMAP_INVALID_PTR) {
	227	keys[n] = key;
	228	ptrs[n] = ptr;
	229	n++;
	230	}
	231	}
	232	return n;
	233	}
	234
	235	int nilfs_direct_delete_and_convert(struct nilfs_bmap *bmap,
3033342a	236	__u64 key, __u64 keys, __u64 ptrs, int n)
36a580eb	237	{
36a580eb KS	238	__le64 *dptrs;
	239	int ret, i, j;
	240
	241	/* no need to allocate any resource for conversion */
	242
	243	/* delete */
8acfbf09	244	ret = bmap->b_ops->bop_delete(bmap, key);
36a580eb KS	245	if (ret < 0)
	246	return ret;
	247
	248	/* free resources */
	249	if (bmap->b_ops->bop_clear != NULL)
8acfbf09	250	bmap->b_ops->bop_clear(bmap);
36a580eb KS	251
36a580eb KS	252	/* convert */
10ff885b	253	dptrs = nilfs_direct_dptrs(bmap);
36a580eb KS	254	for (i = 0, j = 0; i < NILFS_DIRECT_NBLOCKS; i++) {
	255	if ((j < n) && (i == keys[j])) {
	256	dptrs[i] = (i != key) ?
25b8d7de	257	cpu_to_le64(ptrs[j]) :
36a580eb KS	258	NILFS_BMAP_INVALID_PTR;
	259	j++;
	260	} else
	261	dptrs[i] = NILFS_BMAP_INVALID_PTR;
	262	}
	263
3033342a	264	nilfs_direct_init(bmap);
36a580eb KS	265	return 0;
	266	}
	267
583ada47	268	static int nilfs_direct_propagate(struct nilfs_bmap *bmap,
2e0c2c73	269	struct buffer_head *bh)
36a580eb	270	{
2e0c2c73 RK	271	struct nilfs_palloc_req oldreq, newreq;
2e0c2c73 RK	272	struct inode *dat;
36a580eb KS	273	__u64 key;
	274	__u64 ptr;
	275	int ret;
	276
2e0c2c73 RK	277	if (!NILFS_BMAP_USE_VBN(bmap))
	278	return 0;
	279
	280	dat = nilfs_bmap_get_dat(bmap);
	281	key = nilfs_bmap_data_get_key(bmap, bh);
10ff885b	282	ptr = nilfs_direct_get_ptr(bmap, key);
36a580eb	283	if (!buffer_nilfs_volatile(bh)) {
2e0c2c73 RK	284	oldreq.pr_entry_nr = ptr;
	285	newreq.pr_entry_nr = ptr;
	286	ret = nilfs_dat_prepare_update(dat, &oldreq, &newreq);
36a580eb KS	287	if (ret < 0)
36a580eb KS	288	return ret;
2e0c2c73 RK	289	nilfs_dat_commit_update(dat, &oldreq, &newreq,
2e0c2c73 RK	290	bmap->b_ptr_type == NILFS_BMAP_PTR_VS);
36a580eb	291	set_buffer_nilfs_volatile(bh);
10ff885b	292	nilfs_direct_set_ptr(bmap, key, newreq.pr_entry_nr);
36a580eb	293	} else
2e0c2c73	294	ret = nilfs_dat_mark_dirty(dat, ptr);
36a580eb KS	295
	296	return ret;
	297	}
	298
10ff885b	299	static int nilfs_direct_assign_v(struct nilfs_bmap *direct,
36a580eb KS	300	__u64 key, __u64 ptr,
	301	struct buffer_head **bh,
	302	sector_t blocknr,
	303	union nilfs_binfo *binfo)
	304	{
10ff885b	305	struct inode *dat = nilfs_bmap_get_dat(direct);
36a580eb KS	306	union nilfs_bmap_ptr_req req;
	307	int ret;
	308
	309	req.bpr_ptr = ptr;
2e0c2c73 RK	310	ret = nilfs_dat_prepare_start(dat, &req.bpr_req);
	311	if (!ret) {
	312	nilfs_dat_commit_start(dat, &req.bpr_req, blocknr);
25b8d7de RK	313	binfo->bi_v.bi_vblocknr = cpu_to_le64(ptr);
25b8d7de RK	314	binfo->bi_v.bi_blkoff = cpu_to_le64(key);
2e0c2c73 RK	315	}
2e0c2c73 RK	316	return ret;
36a580eb KS	317	}
36a580eb KS	318
10ff885b	319	static int nilfs_direct_assign_p(struct nilfs_bmap *direct,
36a580eb KS	320	__u64 key, __u64 ptr,
	321	struct buffer_head **bh,
	322	sector_t blocknr,
	323	union nilfs_binfo *binfo)
	324	{
	325	nilfs_direct_set_ptr(direct, key, blocknr);
	326
25b8d7de	327	binfo->bi_dat.bi_blkoff = cpu_to_le64(key);
36a580eb KS	328	binfo->bi_dat.bi_level = 0;
	329
	330	return 0;
	331	}
	332
	333	static int nilfs_direct_assign(struct nilfs_bmap *bmap,
	334	struct buffer_head **bh,
	335	sector_t blocknr,
	336	union nilfs_binfo *binfo)
	337	{
36a580eb KS	338	__u64 key;
	339	__u64 ptr;
	340
36a580eb	341	key = nilfs_bmap_data_get_key(bmap, *bh);
1f5abe7e RK	342	if (unlikely(key > NILFS_DIRECT_KEY_MAX)) {
	343	printk(KERN_CRIT "%s: invalid key: %llu\n", __func__,
	344	(unsigned long long)key);
	345	return -EINVAL;
	346	}
10ff885b	347	ptr = nilfs_direct_get_ptr(bmap, key);
1f5abe7e RK	348	if (unlikely(ptr == NILFS_BMAP_INVALID_PTR)) {
	349	printk(KERN_CRIT "%s: invalid pointer: %llu\n", __func__,
	350	(unsigned long long)ptr);
	351	return -EINVAL;
	352	}
36a580eb	353
355c6b61	354	return NILFS_BMAP_USE_VBN(bmap) ?
10ff885b RK	355	nilfs_direct_assign_v(bmap, key, ptr, bh, blocknr, binfo) :
10ff885b RK	356	nilfs_direct_assign_p(bmap, key, ptr, bh, blocknr, binfo);
36a580eb KS	357	}
	358
	359	static const struct nilfs_bmap_operations nilfs_direct_ops = {
	360	.bop_lookup = nilfs_direct_lookup,
c3a7abf0	361	.bop_lookup_contig = nilfs_direct_lookup_contig,
36a580eb KS	362	.bop_insert = nilfs_direct_insert,
	363	.bop_delete = nilfs_direct_delete,
	364	.bop_clear = NULL,
	365
	366	.bop_propagate = nilfs_direct_propagate,
	367
	368	.bop_lookup_dirty_buffers = NULL,
	369
	370	.bop_assign = nilfs_direct_assign,
	371	.bop_mark = NULL,
	372
5b20384f	373	.bop_seek_key = nilfs_direct_seek_key,
36a580eb	374	.bop_last_key = nilfs_direct_last_key,
5b20384f	375
36a580eb KS	376	.bop_check_insert = nilfs_direct_check_insert,
	377	.bop_check_delete = NULL,
	378	.bop_gather_data = nilfs_direct_gather_data,
	379	};
	380
	381
3033342a	382	int nilfs_direct_init(struct nilfs_bmap *bmap)
36a580eb	383	{
36a580eb	384	bmap->b_ops = &nilfs_direct_ops;
36a580eb KS	385	return 0;
36a580eb KS	386	}