[deliverable/linux.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.
 *
 * Written by Koji Sato.
 */

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