Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (C) 2007 Oracle. All rights reserved. |
| 3 | * |
| 4 | * This program is free software; you can redistribute it and/or |
| 5 | * modify it under the terms of the GNU General Public |
| 6 | * License v2 as published by the Free Software Foundation. |
| 7 | * |
| 8 | * This program is distributed in the hope that it will be useful, |
| 9 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 10 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 11 | * General Public License for more details. |
| 12 | * |
| 13 | * You should have received a copy of the GNU General Public |
| 14 | * License along with this program; if not, write to the |
| 15 | * Free Software Foundation, Inc., 59 Temple Place - Suite 330, |
| 16 | * Boston, MA 021110-1307, USA. |
| 17 | */ |
| 18 | |
| 19 | #ifndef __BTRFS_ORDERED_DATA__ |
| 20 | #define __BTRFS_ORDERED_DATA__ |
| 21 | |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame^] | 22 | /* one of these per inode */ |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 23 | struct btrfs_ordered_inode_tree { |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 24 | struct mutex mutex; |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 25 | struct rb_root tree; |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 26 | struct rb_node *last; |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 27 | }; |
| 28 | |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame^] | 29 | /* |
| 30 | * these are used to collect checksums done just before bios submission. |
| 31 | * They are attached via a list into the ordered extent, and |
| 32 | * checksum items are inserted into the tree after all the blocks in |
| 33 | * the ordered extent are on disk |
| 34 | */ |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 35 | struct btrfs_sector_sum { |
| 36 | u64 offset; |
| 37 | u32 sum; |
| 38 | }; |
| 39 | |
| 40 | struct btrfs_ordered_sum { |
| 41 | u64 file_offset; |
| 42 | u64 len; |
| 43 | struct list_head list; |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame^] | 44 | /* last field is a variable length array of btrfs_sector_sums */ |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 45 | struct btrfs_sector_sum sums; |
| 46 | }; |
| 47 | |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame^] | 48 | /* |
| 49 | * bits for the flags field: |
| 50 | * |
| 51 | * BTRFS_ORDERED_IO_DONE is set when all of the blocks are written. |
| 52 | * It is used to make sure metadata is inserted into the tree only once |
| 53 | * per extent. |
| 54 | * |
| 55 | * BTRFS_ORDERED_COMPLETE is set when the extent is removed from the |
| 56 | * rbtree, just before waking any waiters. It is used to indicate the |
| 57 | * IO is done and any metadata is inserted into the tree. |
| 58 | */ |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 59 | #define BTRFS_ORDERED_IO_DONE 0 /* set when all the pages are written */ |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame^] | 60 | |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 61 | #define BTRFS_ORDERED_COMPLETE 1 /* set when removed from the tree */ |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 62 | |
| 63 | struct btrfs_ordered_extent { |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame^] | 64 | /* logical offset in the file */ |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 65 | u64 file_offset; |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame^] | 66 | |
| 67 | /* disk byte number */ |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 68 | u64 start; |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame^] | 69 | |
| 70 | /* length of the extent in bytes */ |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 71 | u64 len; |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame^] | 72 | |
| 73 | /* flags (described above) */ |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 74 | unsigned long flags; |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame^] | 75 | |
| 76 | /* reference count */ |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 77 | atomic_t refs; |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame^] | 78 | |
| 79 | /* list of checksums for insertion when the extent io is done */ |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 80 | struct list_head list; |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame^] | 81 | |
| 82 | /* used to wait for the BTRFS_ORDERED_COMPLETE bit */ |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 83 | wait_queue_head_t wait; |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame^] | 84 | |
| 85 | /* our friendly rbtree entry */ |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 86 | struct rb_node rb_node; |
| 87 | }; |
| 88 | |
| 89 | |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame^] | 90 | /* |
| 91 | * calculates the total size you need to allocate for an ordered sum |
| 92 | * structure spanning 'bytes' in the file |
| 93 | */ |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 94 | static inline int btrfs_ordered_sum_size(struct btrfs_root *root, u64 bytes) |
| 95 | { |
| 96 | unsigned long num_sectors = (bytes + root->sectorsize - 1) / |
| 97 | root->sectorsize; |
| 98 | return sizeof(struct btrfs_ordered_sum) + |
| 99 | num_sectors * sizeof(struct btrfs_sector_sum); |
| 100 | } |
| 101 | |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 102 | static inline void |
| 103 | btrfs_ordered_inode_tree_init(struct btrfs_ordered_inode_tree *t) |
| 104 | { |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 105 | mutex_init(&t->mutex); |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 106 | t->tree.rb_node = NULL; |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 107 | t->last = NULL; |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 108 | } |
| 109 | |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 110 | int btrfs_put_ordered_extent(struct btrfs_ordered_extent *entry); |
| 111 | int btrfs_remove_ordered_extent(struct inode *inode, |
| 112 | struct btrfs_ordered_extent *entry); |
| 113 | int btrfs_dec_test_ordered_pending(struct inode *inode, |
| 114 | u64 file_offset, u64 io_size); |
| 115 | int btrfs_add_ordered_extent(struct inode *inode, u64 file_offset, |
| 116 | u64 start, u64 len); |
| 117 | int btrfs_add_ordered_sum(struct inode *inode, struct btrfs_ordered_sum *sum); |
| 118 | struct btrfs_ordered_extent *btrfs_lookup_ordered_extent(struct inode *inode, |
| 119 | u64 file_offset); |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame^] | 120 | void btrfs_start_ordered_extent(struct inode *inode, |
| 121 | struct btrfs_ordered_extent *entry, int wait); |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 122 | void btrfs_wait_ordered_range(struct inode *inode, u64 start, u64 len); |
| 123 | struct btrfs_ordered_extent * |
| 124 | btrfs_lookup_first_ordered_extent(struct inode * inode, u64 file_offset); |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 125 | int btrfs_ordered_update_i_size(struct inode *inode, |
| 126 | struct btrfs_ordered_extent *ordered); |
Chris Mason | ba1da2f | 2008-07-17 12:54:15 -0400 | [diff] [blame] | 127 | int btrfs_find_ordered_sum(struct inode *inode, u64 offset, u32 *sum); |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 128 | #endif |