mirror of
https://github.com/team-infusion-developers/android_kernel_samsung_msm8976.git
synced 2024-09-21 11:53:01 +00:00
ba1da2f442
Checksum items are not inserted until the entire ordered extent is on disk, but individual pages might be clean and available for reclaim long before the whole extent is on disk. In order to allow those pages to be freed, we need to be able to search the list of ordered extents to find the checksum that is going to be inserted in the tree. This way if the page needs to be read back in before the checksums are in the btree, we'll be able to verify the checksum on the page. This commit adds the ability to search the pending ordered extents for a given offset in the file, and changes btrfs_releasepage to allow ordered pages to be freed. Signed-off-by: Chris Mason <chris.mason@oracle.com>
96 lines
2.9 KiB
C
96 lines
2.9 KiB
C
/*
|
|
* Copyright (C) 2007 Oracle. All rights reserved.
|
|
*
|
|
* This program is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU General Public
|
|
* License v2 as published by the Free Software Foundation.
|
|
*
|
|
* 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., 59 Temple Place - Suite 330,
|
|
* Boston, MA 021110-1307, USA.
|
|
*/
|
|
|
|
#ifndef __BTRFS_ORDERED_DATA__
|
|
#define __BTRFS_ORDERED_DATA__
|
|
|
|
struct btrfs_ordered_inode_tree {
|
|
struct mutex mutex;
|
|
struct rb_root tree;
|
|
struct rb_node *last;
|
|
};
|
|
|
|
struct btrfs_sector_sum {
|
|
u64 offset;
|
|
u32 sum;
|
|
};
|
|
|
|
struct btrfs_ordered_sum {
|
|
u64 file_offset;
|
|
u64 len;
|
|
struct list_head list;
|
|
struct btrfs_sector_sum sums;
|
|
};
|
|
|
|
/* bits for the flags field */
|
|
#define BTRFS_ORDERED_IO_DONE 0 /* set when all the pages are written */
|
|
#define BTRFS_ORDERED_COMPLETE 1 /* set when removed from the tree */
|
|
#define BTRFS_ORDERED_START 2 /* set when tree setup */
|
|
|
|
struct btrfs_ordered_extent {
|
|
u64 file_offset;
|
|
u64 start;
|
|
u64 len;
|
|
unsigned long flags;
|
|
atomic_t refs;
|
|
struct list_head list;
|
|
struct inode *inode;
|
|
wait_queue_head_t wait;
|
|
struct rb_node rb_node;
|
|
};
|
|
|
|
|
|
static inline int btrfs_ordered_sum_size(struct btrfs_root *root, u64 bytes)
|
|
{
|
|
unsigned long num_sectors = (bytes + root->sectorsize - 1) /
|
|
root->sectorsize;
|
|
return sizeof(struct btrfs_ordered_sum) +
|
|
num_sectors * sizeof(struct btrfs_sector_sum);
|
|
}
|
|
|
|
static inline void
|
|
btrfs_ordered_inode_tree_init(struct btrfs_ordered_inode_tree *t)
|
|
{
|
|
mutex_init(&t->mutex);
|
|
t->tree.rb_node = NULL;
|
|
t->last = NULL;
|
|
}
|
|
|
|
int btrfs_put_ordered_extent(struct btrfs_ordered_extent *entry);
|
|
int btrfs_remove_ordered_extent(struct inode *inode,
|
|
struct btrfs_ordered_extent *entry);
|
|
int btrfs_dec_test_ordered_pending(struct inode *inode,
|
|
u64 file_offset, u64 io_size);
|
|
int btrfs_add_ordered_extent(struct inode *inode, u64 file_offset,
|
|
u64 start, u64 len);
|
|
int btrfs_add_ordered_sum(struct inode *inode, struct btrfs_ordered_sum *sum);
|
|
struct btrfs_ordered_extent *btrfs_lookup_ordered_extent(struct inode *inode,
|
|
u64 file_offset);
|
|
void btrfs_wait_ordered_extent(struct inode *inode,
|
|
struct btrfs_ordered_extent *entry);
|
|
void btrfs_wait_ordered_range(struct inode *inode, u64 start, u64 len);
|
|
struct btrfs_ordered_extent *
|
|
btrfs_lookup_first_ordered_extent(struct inode * inode, u64 file_offset);
|
|
int btrfs_add_ordered_pending(struct inode *inode,
|
|
struct btrfs_ordered_extent *ordered,
|
|
u64 start, u64 len);
|
|
int btrfs_ordered_update_i_size(struct inode *inode,
|
|
struct btrfs_ordered_extent *ordered);
|
|
int btrfs_find_ordered_sum(struct inode *inode, u64 offset, u32 *sum);
|
|
#endif
|