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

// SPDX-License-Identifier: GPL-2.0+
/*
 * bmap.c - NILFS block mapping.
 *
 * Copyright (C) 2006-2008 Nippon Telegraph and Telephone Corporation.
 *
 * Written by Koji Sato.
 */

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

struct inode *nilfs_bmap_get_dat(const struct nilfs_bmap *bmap)
{
	struct the_nilfs *nilfs = bmap->b_inode->i_sb->s_fs_info;

	return nilfs->ns_dat;
}

static int nilfs_bmap_convert_error(struct nilfs_bmap *bmap,
				     const char *fname, int err)
{
	struct inode *inode = bmap->b_inode;

	if (err == -EINVAL) {
		__nilfs_error(inode->i_sb, fname,
			      "broken bmap (inode number=%lu)", inode->i_ino);
		err = -EIO;
	}
	return err;
}

/**
 * nilfs_bmap_lookup_at_level - find a data block or node block
 * @bmap: bmap
 * @key: key
 * @level: level
 * @ptrp: place to store the value associated to @key
 *
 * Description: nilfs_bmap_lookup_at_level() finds a record whose key
 * matches @key in the block at @level of the bmap.
 *
 * Return Value: On success, 0 is returned and the record associated with @key
 * is stored in the place pointed by @ptrp. 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_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) {
		ret = nilfs_bmap_convert_error(bmap, __func__, ret);
		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 int 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 nilfs_bmap_convert_error(bmap, __func__, 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, __u64 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 nilfs_bmap_convert_error(bmap, __func__, 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);
}

/**
 * nilfs_bmap_seek_key - seek a valid entry and return its key
 * @bmap: bmap struct
 * @start: start key number
 * @keyp: place to store valid key
 *
 * Description: nilfs_bmap_seek_key() seeks a valid key on @bmap
 * starting from @start, and stores it to @keyp if found.
 *
 * 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 - No valid entry was found
 */
int nilfs_bmap_seek_key(struct nilfs_bmap *bmap, __u64 start, __u64 *keyp)
{
	int ret;

	down_read(&bmap->b_sem);
	ret = bmap->b_ops->bop_seek_key(bmap, start, keyp);
	up_read(&bmap->b_sem);

	if (ret < 0)
		ret = nilfs_bmap_convert_error(bmap, __func__, ret);
	return ret;
}

int nilfs_bmap_last_key(struct nilfs_bmap *bmap, __u64 *keyp)
{
	int ret;

	down_read(&bmap->b_sem);
	ret = bmap->b_ops->bop_last_key(bmap, keyp);
	up_read(&bmap->b_sem);

	if (ret < 0)
		ret = nilfs_bmap_convert_error(bmap, __func__, ret);
	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, __u64 key)
{
	int ret;

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

	return nilfs_bmap_convert_error(bmap, __func__, ret);
}

static int nilfs_bmap_do_truncate(struct nilfs_bmap *bmap, __u64 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, __u64 key)
{
	int ret;

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

	return nilfs_bmap_convert_error(bmap, __func__, 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 nilfs_bmap_convert_error(bmap, __func__, 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 nilfs_bmap_convert_error(bmap, __func__, 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 nilfs_bmap_convert_error(bmap, __func__, 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
 */
__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_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);
}

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_save(const struct nilfs_bmap *bmap,
		     struct nilfs_bmap_store *store)
{
	memcpy(store->data, bmap->b_u.u_data, sizeof(store->data));
	store->last_allocated_key = bmap->b_last_allocated_key;
	store->last_allocated_ptr = bmap->b_last_allocated_ptr;
	store->state = bmap->b_state;
}

void nilfs_bmap_restore(struct nilfs_bmap *bmap,
			const struct nilfs_bmap_store *store)
{
	memcpy(bmap->b_u.u_data, store->data, sizeof(store->data));
	bmap->b_last_allocated_key = store->last_allocated_key;
	bmap->b_last_allocated_ptr = store->last_allocated_ptr;
	bmap->b_state = store->state;
}
Commit	Line	Data
ae98043f	1	// SPDX-License-Identifier: GPL-2.0+
bdb265ea KS	2	/*
	3	* bmap.c - NILFS block mapping.
	4	*
	5	* Copyright (C) 2006-2008 Nippon Telegraph and Telephone Corporation.
	6	*
4b420ab4	7	* Written by Koji Sato.
bdb265ea KS	8	*/
	9
	10	#include <linux/fs.h>
	11	#include <linux/string.h>
	12	#include <linux/errno.h>
	13	#include "nilfs.h"
	14	#include "bmap.h"
05d0e94b RK	15	#include "btree.h"
05d0e94b RK	16	#include "direct.h"
bdb265ea KS	17	#include "btnode.h"
	18	#include "mdt.h"
	19	#include "dat.h"
	20	#include "alloc.h"
	21
c3a7abf0	22	struct inode nilfs_bmap_get_dat(const struct nilfs_bmap bmap)
d4b96157	23	{
0ef28f9a RK	24	struct the_nilfs *nilfs = bmap->b_inode->i_sb->s_fs_info;
	25
	26	return nilfs->ns_dat;
d4b96157 RK	27	}
d4b96157 RK	28
e828949e RK	29	static int nilfs_bmap_convert_error(struct nilfs_bmap *bmap,
	30	const char *fname, int err)
	31	{
	32	struct inode *inode = bmap->b_inode;
	33
	34	if (err == -EINVAL) {
cae3d4ca RK	35	__nilfs_error(inode->i_sb, fname,
cae3d4ca RK	36	"broken bmap (inode number=%lu)", inode->i_ino);
e828949e RK	37	err = -EIO;
	38	}
	39	return err;
	40	}
	41
0f3fe33b RK	42	/**
	43	* nilfs_bmap_lookup_at_level - find a data block or node block
	44	* @bmap: bmap
	45	* @key: key
	46	* @level: level
	47	* @ptrp: place to store the value associated to @key
	48	*
	49	* Description: nilfs_bmap_lookup_at_level() finds a record whose key
	50	* matches @key in the block at @level of the bmap.
	51	*
	52	* Return Value: On success, 0 is returned and the record associated with @key
	53	* is stored in the place pointed by @ptrp. On error, one of the following
	54	* negative error codes is returned.
	55	*
	56	* %-EIO - I/O error.
	57	*
	58	* %-ENOMEM - Insufficient amount of memory available.
	59	*
	60	* %-ENOENT - A record associated with @key does not exist.
	61	*/
bdb265ea KS	62	int nilfs_bmap_lookup_at_level(struct nilfs_bmap *bmap, __u64 key, int level,
	63	__u64 *ptrp)
	64	{
d4b96157	65	sector_t blocknr;
bdb265ea KS	66	int ret;
	67
	68	down_read(&bmap->b_sem);
8acfbf09	69	ret = bmap->b_ops->bop_lookup(bmap, key, level, ptrp);
e828949e RK	70	if (ret < 0) {
e828949e RK	71	ret = nilfs_bmap_convert_error(bmap, __func__, ret);
bdb265ea	72	goto out;
e828949e	73	}
d4b96157 RK	74	if (NILFS_BMAP_USE_VBN(bmap)) {
	75	ret = nilfs_dat_translate(nilfs_bmap_get_dat(bmap), *ptrp,
	76	&blocknr);
	77	if (!ret)
	78	*ptrp = blocknr;
bdb265ea KS	79	}
	80
	81	out:
	82	up_read(&bmap->b_sem);
	83	return ret;
	84	}
	85
c3a7abf0	86	int nilfs_bmap_lookup_contig(struct nilfs_bmap bmap, __u64 key, __u64 ptrp,
0c6c44cb	87	unsigned int maxblocks)
c3a7abf0 RK	88	{
	89	int ret;
	90
	91	down_read(&bmap->b_sem);
	92	ret = bmap->b_ops->bop_lookup_contig(bmap, key, ptrp, maxblocks);
	93	up_read(&bmap->b_sem);
e828949e RK	94
e828949e RK	95	return nilfs_bmap_convert_error(bmap, __func__, ret);
c3a7abf0	96	}
bdb265ea	97
bdb265ea KS	98	static int nilfs_bmap_do_insert(struct nilfs_bmap *bmap, __u64 key, __u64 ptr)
	99	{
	100	__u64 keys[NILFS_BMAP_SMALL_HIGH + 1];
	101	__u64 ptrs[NILFS_BMAP_SMALL_HIGH + 1];
	102	int ret, n;
	103
	104	if (bmap->b_ops->bop_check_insert != NULL) {
8acfbf09	105	ret = bmap->b_ops->bop_check_insert(bmap, key);
bdb265ea	106	if (ret > 0) {
8acfbf09	107	n = bmap->b_ops->bop_gather_data(
bdb265ea KS	108	bmap, keys, ptrs, NILFS_BMAP_SMALL_HIGH + 1);
	109	if (n < 0)
	110	return n;
	111	ret = nilfs_btree_convert_and_insert(
3033342a	112	bmap, key, ptr, keys, ptrs, n);
bdb265ea KS	113	if (ret == 0)
	114	bmap->b_u.u_flags \|= NILFS_BMAP_LARGE;
	115
	116	return ret;
	117	} else if (ret < 0)
	118	return ret;
	119	}
	120
8acfbf09	121	return bmap->b_ops->bop_insert(bmap, key, ptr);
bdb265ea KS	122	}
	123
	124	/**
	125	* nilfs_bmap_insert - insert a new key-record pair into a bmap
	126	* @bmap: bmap
	127	* @key: key
	128	* @rec: record
	129	*
	130	* Description: nilfs_bmap_insert() inserts the new key-record pair specified
	131	* by @key and @rec into @bmap.
	132	*
	133	* Return Value: On success, 0 is returned. On error, one of the following
	134	* negative error codes is returned.
	135	*
	136	* %-EIO - I/O error.
	137	*
	138	* %-ENOMEM - Insufficient amount of memory available.
	139	*
	140	* %-EEXIST - A record associated with @key already exist.
	141	*/
3568a13f	142	int nilfs_bmap_insert(struct nilfs_bmap *bmap, __u64 key, unsigned long rec)
bdb265ea KS	143	{
	144	int ret;
	145
	146	down_write(&bmap->b_sem);
	147	ret = nilfs_bmap_do_insert(bmap, key, rec);
	148	up_write(&bmap->b_sem);
e828949e RK	149
e828949e RK	150	return nilfs_bmap_convert_error(bmap, __func__, ret);
bdb265ea KS	151	}
	152
	153	static int nilfs_bmap_do_delete(struct nilfs_bmap *bmap, __u64 key)
	154	{
	155	__u64 keys[NILFS_BMAP_LARGE_LOW + 1];
	156	__u64 ptrs[NILFS_BMAP_LARGE_LOW + 1];
	157	int ret, n;
	158
	159	if (bmap->b_ops->bop_check_delete != NULL) {
8acfbf09	160	ret = bmap->b_ops->bop_check_delete(bmap, key);
bdb265ea	161	if (ret > 0) {
8acfbf09	162	n = bmap->b_ops->bop_gather_data(
bdb265ea KS	163	bmap, keys, ptrs, NILFS_BMAP_LARGE_LOW + 1);
	164	if (n < 0)
	165	return n;
	166	ret = nilfs_direct_delete_and_convert(
3033342a	167	bmap, key, keys, ptrs, n);
bdb265ea KS	168	if (ret == 0)
	169	bmap->b_u.u_flags &= ~NILFS_BMAP_LARGE;
	170
	171	return ret;
	172	} else if (ret < 0)
	173	return ret;
	174	}
	175
8acfbf09	176	return bmap->b_ops->bop_delete(bmap, key);
bdb265ea KS	177	}
bdb265ea KS	178
5b20384f RK	179	/**
	180	* nilfs_bmap_seek_key - seek a valid entry and return its key
	181	* @bmap: bmap struct
	182	* @start: start key number
	183	* @keyp: place to store valid key
	184	*
	185	* Description: nilfs_bmap_seek_key() seeks a valid key on @bmap
	186	* starting from @start, and stores it to @keyp if found.
	187	*
	188	* Return Value: On success, 0 is returned. On error, one of the following
	189	* negative error codes is returned.
	190	*
	191	* %-EIO - I/O error.
	192	*
	193	* %-ENOMEM - Insufficient amount of memory available.
	194	*
	195	* %-ENOENT - No valid entry was found
	196	*/
	197	int nilfs_bmap_seek_key(struct nilfs_bmap bmap, __u64 start, __u64 keyp)
	198	{
	199	int ret;
	200
	201	down_read(&bmap->b_sem);
	202	ret = bmap->b_ops->bop_seek_key(bmap, start, keyp);
	203	up_read(&bmap->b_sem);
	204
	205	if (ret < 0)
	206	ret = nilfs_bmap_convert_error(bmap, __func__, ret);
	207	return ret;
	208	}
	209
3568a13f	210	int nilfs_bmap_last_key(struct nilfs_bmap bmap, __u64 keyp)
bdb265ea	211	{
bdb265ea KS	212	int ret;
	213
	214	down_read(&bmap->b_sem);
3568a13f	215	ret = bmap->b_ops->bop_last_key(bmap, keyp);
bdb265ea	216	up_read(&bmap->b_sem);
e828949e RK	217
	218	if (ret < 0)
	219	ret = nilfs_bmap_convert_error(bmap, __func__, ret);
bdb265ea KS	220	return ret;
	221	}
	222
	223	/**
	224	* nilfs_bmap_delete - delete a key-record pair from a bmap
	225	* @bmap: bmap
	226	* @key: key
	227	*
	228	* Description: nilfs_bmap_delete() deletes the key-record pair specified by
	229	* @key from @bmap.
	230	*
	231	* Return Value: On success, 0 is returned. On error, one of the following
	232	* negative error codes is returned.
	233	*
	234	* %-EIO - I/O error.
	235	*
	236	* %-ENOMEM - Insufficient amount of memory available.
	237	*
	238	* %-ENOENT - A record associated with @key does not exist.
	239	*/
3568a13f	240	int nilfs_bmap_delete(struct nilfs_bmap *bmap, __u64 key)
bdb265ea KS	241	{
	242	int ret;
	243
	244	down_write(&bmap->b_sem);
	245	ret = nilfs_bmap_do_delete(bmap, key);
	246	up_write(&bmap->b_sem);
e828949e RK	247
e828949e RK	248	return nilfs_bmap_convert_error(bmap, __func__, ret);
bdb265ea KS	249	}
bdb265ea KS	250
3568a13f	251	static int nilfs_bmap_do_truncate(struct nilfs_bmap *bmap, __u64 key)
bdb265ea KS	252	{
	253	__u64 lastkey;
	254	int ret;
	255
8acfbf09	256	ret = bmap->b_ops->bop_last_key(bmap, &lastkey);
bdb265ea KS	257	if (ret < 0) {
	258	if (ret == -ENOENT)
	259	ret = 0;
	260	return ret;
	261	}
	262
	263	while (key <= lastkey) {
	264	ret = nilfs_bmap_do_delete(bmap, lastkey);
	265	if (ret < 0)
	266	return ret;
8acfbf09	267	ret = bmap->b_ops->bop_last_key(bmap, &lastkey);
bdb265ea KS	268	if (ret < 0) {
	269	if (ret == -ENOENT)
	270	ret = 0;
	271	return ret;
	272	}
	273	}
	274	return 0;
	275	}
	276
	277	/**
	278	* nilfs_bmap_truncate - truncate a bmap to a specified key
	279	* @bmap: bmap
	280	* @key: key
	281	*
	282	* Description: nilfs_bmap_truncate() removes key-record pairs whose keys are
	283	* greater than or equal to @key from @bmap.
	284	*
	285	* Return Value: On success, 0 is returned. On error, one of the following
	286	* negative error codes is returned.
	287	*
	288	* %-EIO - I/O error.
	289	*
	290	* %-ENOMEM - Insufficient amount of memory available.
	291	*/
3568a13f	292	int nilfs_bmap_truncate(struct nilfs_bmap *bmap, __u64 key)
bdb265ea KS	293	{
	294	int ret;
	295
	296	down_write(&bmap->b_sem);
	297	ret = nilfs_bmap_do_truncate(bmap, key);
	298	up_write(&bmap->b_sem);
e828949e RK	299
e828949e RK	300	return nilfs_bmap_convert_error(bmap, __func__, ret);
bdb265ea KS	301	}
	302
	303	/**
	304	* nilfs_bmap_clear - free resources a bmap holds
	305	* @bmap: bmap
	306	*
	307	* Description: nilfs_bmap_clear() frees resources associated with @bmap.
	308	*/
	309	void nilfs_bmap_clear(struct nilfs_bmap *bmap)
	310	{
	311	down_write(&bmap->b_sem);
	312	if (bmap->b_ops->bop_clear != NULL)
8acfbf09	313	bmap->b_ops->bop_clear(bmap);
bdb265ea KS	314	up_write(&bmap->b_sem);
	315	}
	316
	317	/**
	318	* nilfs_bmap_propagate - propagate dirty state
	319	* @bmap: bmap
	320	* @bh: buffer head
	321	*
	322	* Description: nilfs_bmap_propagate() marks the buffers that directly or
	323	* indirectly refer to the block specified by @bh dirty.
	324	*
	325	* Return Value: On success, 0 is returned. On error, one of the following
	326	* negative error codes is returned.
	327	*
	328	* %-EIO - I/O error.
	329	*
	330	* %-ENOMEM - Insufficient amount of memory available.
	331	*/
	332	int nilfs_bmap_propagate(struct nilfs_bmap bmap, struct buffer_head bh)
	333	{
	334	int ret;
	335
	336	down_write(&bmap->b_sem);
8acfbf09	337	ret = bmap->b_ops->bop_propagate(bmap, bh);
bdb265ea	338	up_write(&bmap->b_sem);
e828949e RK	339
e828949e RK	340	return nilfs_bmap_convert_error(bmap, __func__, ret);
bdb265ea KS	341	}
	342
	343	/**
	344	* nilfs_bmap_lookup_dirty_buffers -
	345	* @bmap: bmap
	346	* @listp: pointer to buffer head list
	347	*/
	348	void nilfs_bmap_lookup_dirty_buffers(struct nilfs_bmap *bmap,
	349	struct list_head *listp)
	350	{
	351	if (bmap->b_ops->bop_lookup_dirty_buffers != NULL)
8acfbf09	352	bmap->b_ops->bop_lookup_dirty_buffers(bmap, listp);
bdb265ea KS	353	}
	354
	355	/**
	356	* nilfs_bmap_assign - assign a new block number to a block
	357	* @bmap: bmap
	358	* @bhp: pointer to buffer head
	359	* @blocknr: block number
	360	* @binfo: block information
	361	*
	362	* Description: nilfs_bmap_assign() assigns the block number @blocknr to the
	363	* buffer specified by @bh.
	364	*
	365	* Return Value: On success, 0 is returned and the buffer head of a newly
	366	* create buffer and the block information associated with the buffer are
	367	* stored in the place pointed by @bh and @binfo, respectively. On error, one
	368	* of the following negative error codes is returned.
	369	*
	370	* %-EIO - I/O error.
	371	*
	372	* %-ENOMEM - Insufficient amount of memory available.
	373	*/
	374	int nilfs_bmap_assign(struct nilfs_bmap *bmap,
	375	struct buffer_head **bh,
	376	unsigned long blocknr,
	377	union nilfs_binfo *binfo)
	378	{
	379	int ret;
	380
	381	down_write(&bmap->b_sem);
8acfbf09	382	ret = bmap->b_ops->bop_assign(bmap, bh, blocknr, binfo);
bdb265ea	383	up_write(&bmap->b_sem);
e828949e RK	384
e828949e RK	385	return nilfs_bmap_convert_error(bmap, __func__, ret);
bdb265ea KS	386	}
	387
	388	/**
	389	* nilfs_bmap_mark - mark block dirty
	390	* @bmap: bmap
	391	* @key: key
	392	* @level: level
	393	*
	394	* Description: nilfs_bmap_mark() marks the block specified by @key and @level
	395	* as dirty.
	396	*
	397	* Return Value: On success, 0 is returned. On error, one of the following
	398	* negative error codes is returned.
	399	*
	400	* %-EIO - I/O error.
	401	*
	402	* %-ENOMEM - Insufficient amount of memory available.
	403	*/
	404	int nilfs_bmap_mark(struct nilfs_bmap *bmap, __u64 key, int level)
	405	{
	406	int ret;
	407
	408	if (bmap->b_ops->bop_mark == NULL)
	409	return 0;
	410
	411	down_write(&bmap->b_sem);
8acfbf09	412	ret = bmap->b_ops->bop_mark(bmap, key, level);
bdb265ea	413	up_write(&bmap->b_sem);
e828949e RK	414
e828949e RK	415	return nilfs_bmap_convert_error(bmap, __func__, ret);
bdb265ea KS	416	}
	417
	418	/**
	419	* nilfs_bmap_test_and_clear_dirty - test and clear a bmap dirty state
	420	* @bmap: bmap
	421	*
	422	* Description: nilfs_test_and_clear() is the atomic operation to test and
	423	* clear the dirty state of @bmap.
	424	*
	425	* Return Value: 1 is returned if @bmap is dirty, or 0 if clear.
	426	*/
	427	int nilfs_bmap_test_and_clear_dirty(struct nilfs_bmap *bmap)
	428	{
	429	int ret;
	430
	431	down_write(&bmap->b_sem);
	432	ret = nilfs_bmap_dirty(bmap);
	433	nilfs_bmap_clear_dirty(bmap);
	434	up_write(&bmap->b_sem);
	435	return ret;
	436	}
	437
	438
	439	/*
	440	* Internal use only
	441	*/
bdb265ea KS	442	__u64 nilfs_bmap_data_get_key(const struct nilfs_bmap *bmap,
	443	const struct buffer_head *bh)
	444	{
	445	struct buffer_head *pbh;
	446	__u64 key;
	447
09cbfeaf	448	key = page_index(bh->b_page) << (PAGE_SHIFT -
bdb265ea	449	bmap->b_inode->i_blkbits);
5ee58148 JS	450	for (pbh = page_buffers(bh->b_page); pbh != bh; pbh = pbh->b_this_page)
5ee58148 JS	451	key++;
bdb265ea KS	452
	453	return key;
	454	}
	455
	456	__u64 nilfs_bmap_find_target_seq(const struct nilfs_bmap *bmap, __u64 key)
	457	{
	458	__s64 diff;
	459
	460	diff = key - bmap->b_last_allocated_key;
	461	if ((nilfs_bmap_keydiff_abs(diff) < NILFS_INODE_BMAP_SIZE) &&
	462	(bmap->b_last_allocated_ptr != NILFS_BMAP_INVALID_PTR) &&
	463	(bmap->b_last_allocated_ptr + diff > 0))
	464	return bmap->b_last_allocated_ptr + diff;
	465	else
	466	return NILFS_BMAP_INVALID_PTR;
	467	}
	468
bdb265ea KS	469	#define NILFS_BMAP_GROUP_DIV 8
	470	__u64 nilfs_bmap_find_target_in_group(const struct nilfs_bmap *bmap)
	471	{
	472	struct inode *dat = nilfs_bmap_get_dat(bmap);
	473	unsigned long entries_per_group = nilfs_palloc_entries_per_group(dat);
	474	unsigned long group = bmap->b_inode->i_ino / entries_per_group;
	475
	476	return group * entries_per_group +
	477	(bmap->b_inode->i_ino % NILFS_BMAP_GROUP_DIV) *
	478	(entries_per_group / NILFS_BMAP_GROUP_DIV);
	479	}
	480
bcb48891	481	static struct lock_class_key nilfs_bmap_dat_lock_key;
ff54de36	482	static struct lock_class_key nilfs_bmap_mdt_lock_key;
bcb48891	483
bdb265ea KS	484	/**
	485	* nilfs_bmap_read - read a bmap from an inode
	486	* @bmap: bmap
	487	* @raw_inode: on-disk inode
	488	*
	489	* Description: nilfs_bmap_read() initializes the bmap @bmap.
	490	*
	491	* Return Value: On success, 0 is returned. On error, the following negative
	492	* error code is returned.
	493	*
	494	* %-ENOMEM - Insufficient amount of memory available.
	495	*/
	496	int nilfs_bmap_read(struct nilfs_bmap bmap, struct nilfs_inode raw_inode)
	497	{
	498	if (raw_inode == NULL)
	499	memset(bmap->b_u.u_data, 0, NILFS_BMAP_SIZE);
	500	else
	501	memcpy(bmap->b_u.u_data, raw_inode->i_bmap, NILFS_BMAP_SIZE);
	502
	503	init_rwsem(&bmap->b_sem);
	504	bmap->b_state = 0;
	505	bmap->b_inode = &NILFS_BMAP_I(bmap)->vfs_inode;
	506	switch (bmap->b_inode->i_ino) {
	507	case NILFS_DAT_INO:
d4b96157 RK	508	bmap->b_ptr_type = NILFS_BMAP_PTR_P;
d4b96157 RK	509	bmap->b_last_allocated_key = 0;
bdb265ea	510	bmap->b_last_allocated_ptr = NILFS_BMAP_NEW_PTR_INIT;
bcb48891	511	lockdep_set_class(&bmap->b_sem, &nilfs_bmap_dat_lock_key);
bdb265ea KS	512	break;
	513	case NILFS_CPFILE_INO:
	514	case NILFS_SUFILE_INO:
d4b96157 RK	515	bmap->b_ptr_type = NILFS_BMAP_PTR_VS;
d4b96157 RK	516	bmap->b_last_allocated_key = 0;
bdb265ea	517	bmap->b_last_allocated_ptr = NILFS_BMAP_INVALID_PTR;
ff54de36	518	lockdep_set_class(&bmap->b_sem, &nilfs_bmap_mdt_lock_key);
bdb265ea	519	break;
ff54de36 RK	520	case NILFS_IFILE_INO:
	521	lockdep_set_class(&bmap->b_sem, &nilfs_bmap_mdt_lock_key);
	522	/* Fall through */
bdb265ea	523	default:
d4b96157 RK	524	bmap->b_ptr_type = NILFS_BMAP_PTR_VM;
d4b96157 RK	525	bmap->b_last_allocated_key = 0;
bdb265ea KS	526	bmap->b_last_allocated_ptr = NILFS_BMAP_INVALID_PTR;
	527	break;
	528	}
	529
	530	return (bmap->b_u.u_flags & NILFS_BMAP_LARGE) ?
3033342a	531	nilfs_btree_init(bmap) : nilfs_direct_init(bmap);
bdb265ea KS	532	}
	533
	534	/**
	535	* nilfs_bmap_write - write back a bmap to an inode
	536	* @bmap: bmap
	537	* @raw_inode: on-disk inode
	538	*
	539	* Description: nilfs_bmap_write() stores @bmap in @raw_inode.
	540	*/
	541	void nilfs_bmap_write(struct nilfs_bmap bmap, struct nilfs_inode raw_inode)
	542	{
	543	down_write(&bmap->b_sem);
	544	memcpy(raw_inode->i_bmap, bmap->b_u.u_data,
	545	NILFS_INODE_BMAP_SIZE * sizeof(__le64));
	546	if (bmap->b_inode->i_ino == NILFS_DAT_INO)
	547	bmap->b_last_allocated_ptr = NILFS_BMAP_NEW_PTR_INIT;
	548
	549	up_write(&bmap->b_sem);
	550	}
	551
	552	void nilfs_bmap_init_gc(struct nilfs_bmap *bmap)
	553	{
	554	memset(&bmap->b_u, 0, NILFS_BMAP_SIZE);
	555	init_rwsem(&bmap->b_sem);
	556	bmap->b_inode = &NILFS_BMAP_I(bmap)->vfs_inode;
d4b96157	557	bmap->b_ptr_type = NILFS_BMAP_PTR_U;
bdb265ea KS	558	bmap->b_last_allocated_key = 0;
	559	bmap->b_last_allocated_ptr = NILFS_BMAP_INVALID_PTR;
	560	bmap->b_state = 0;
	561	nilfs_btree_init_gc(bmap);
	562	}
	563
a8070dd3 RK	564	void nilfs_bmap_save(const struct nilfs_bmap *bmap,
	565	struct nilfs_bmap_store *store)
	566	{
	567	memcpy(store->data, bmap->b_u.u_data, sizeof(store->data));
	568	store->last_allocated_key = bmap->b_last_allocated_key;
	569	store->last_allocated_ptr = bmap->b_last_allocated_ptr;
	570	store->state = bmap->b_state;
	571	}
	572
	573	void nilfs_bmap_restore(struct nilfs_bmap *bmap,
	574	const struct nilfs_bmap_store *store)
	575	{
	576	memcpy(bmap->b_u.u_data, store->data, sizeof(store->data));
	577	bmap->b_last_allocated_key = store->last_allocated_key;
	578	bmap->b_last_allocated_ptr = store->last_allocated_ptr;
	579	bmap->b_state = store->state;
	580	}