Commit | Line | Data |
---|---|---|
dc17ff8f CM |
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 | ||
eb84ae03 | 22 | /* one of these per inode */ |
dc17ff8f | 23 | struct btrfs_ordered_inode_tree { |
e6dcd2dc | 24 | struct mutex mutex; |
dc17ff8f | 25 | struct rb_root tree; |
e6dcd2dc | 26 | struct rb_node *last; |
dc17ff8f CM |
27 | }; |
28 | ||
eb84ae03 CM |
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 | */ | |
e6dcd2dc CM |
35 | struct btrfs_sector_sum { |
36 | u64 offset; | |
37 | u32 sum; | |
38 | }; | |
39 | ||
40 | struct btrfs_ordered_sum { | |
41 | u64 file_offset; | |
3edf7d33 CM |
42 | /* |
43 | * this is the length in bytes covered by the sums array below. | |
44 | * But, the sums array may not be contiguous in the file. | |
45 | */ | |
46 | unsigned long len; | |
e6dcd2dc | 47 | struct list_head list; |
eb84ae03 | 48 | /* last field is a variable length array of btrfs_sector_sums */ |
e6dcd2dc CM |
49 | struct btrfs_sector_sum sums; |
50 | }; | |
51 | ||
eb84ae03 CM |
52 | /* |
53 | * bits for the flags field: | |
54 | * | |
55 | * BTRFS_ORDERED_IO_DONE is set when all of the blocks are written. | |
56 | * It is used to make sure metadata is inserted into the tree only once | |
57 | * per extent. | |
58 | * | |
59 | * BTRFS_ORDERED_COMPLETE is set when the extent is removed from the | |
60 | * rbtree, just before waking any waiters. It is used to indicate the | |
61 | * IO is done and any metadata is inserted into the tree. | |
62 | */ | |
e6dcd2dc | 63 | #define BTRFS_ORDERED_IO_DONE 0 /* set when all the pages are written */ |
eb84ae03 | 64 | |
e6dcd2dc | 65 | #define BTRFS_ORDERED_COMPLETE 1 /* set when removed from the tree */ |
e6dcd2dc CM |
66 | |
67 | struct btrfs_ordered_extent { | |
eb84ae03 | 68 | /* logical offset in the file */ |
e6dcd2dc | 69 | u64 file_offset; |
eb84ae03 CM |
70 | |
71 | /* disk byte number */ | |
e6dcd2dc | 72 | u64 start; |
eb84ae03 CM |
73 | |
74 | /* length of the extent in bytes */ | |
e6dcd2dc | 75 | u64 len; |
eb84ae03 CM |
76 | |
77 | /* flags (described above) */ | |
e6dcd2dc | 78 | unsigned long flags; |
eb84ae03 CM |
79 | |
80 | /* reference count */ | |
e6dcd2dc | 81 | atomic_t refs; |
eb84ae03 CM |
82 | |
83 | /* list of checksums for insertion when the extent io is done */ | |
e6dcd2dc | 84 | struct list_head list; |
eb84ae03 CM |
85 | |
86 | /* used to wait for the BTRFS_ORDERED_COMPLETE bit */ | |
e6dcd2dc | 87 | wait_queue_head_t wait; |
eb84ae03 CM |
88 | |
89 | /* our friendly rbtree entry */ | |
e6dcd2dc CM |
90 | struct rb_node rb_node; |
91 | }; | |
92 | ||
93 | ||
eb84ae03 CM |
94 | /* |
95 | * calculates the total size you need to allocate for an ordered sum | |
96 | * structure spanning 'bytes' in the file | |
97 | */ | |
e6dcd2dc CM |
98 | static inline int btrfs_ordered_sum_size(struct btrfs_root *root, u64 bytes) |
99 | { | |
100 | unsigned long num_sectors = (bytes + root->sectorsize - 1) / | |
101 | root->sectorsize; | |
3edf7d33 | 102 | num_sectors++; |
e6dcd2dc CM |
103 | return sizeof(struct btrfs_ordered_sum) + |
104 | num_sectors * sizeof(struct btrfs_sector_sum); | |
105 | } | |
106 | ||
dc17ff8f CM |
107 | static inline void |
108 | btrfs_ordered_inode_tree_init(struct btrfs_ordered_inode_tree *t) | |
109 | { | |
e6dcd2dc | 110 | mutex_init(&t->mutex); |
dc17ff8f | 111 | t->tree.rb_node = NULL; |
e6dcd2dc | 112 | t->last = NULL; |
dc17ff8f CM |
113 | } |
114 | ||
e6dcd2dc CM |
115 | int btrfs_put_ordered_extent(struct btrfs_ordered_extent *entry); |
116 | int btrfs_remove_ordered_extent(struct inode *inode, | |
117 | struct btrfs_ordered_extent *entry); | |
118 | int btrfs_dec_test_ordered_pending(struct inode *inode, | |
119 | u64 file_offset, u64 io_size); | |
120 | int btrfs_add_ordered_extent(struct inode *inode, u64 file_offset, | |
121 | u64 start, u64 len); | |
3edf7d33 CM |
122 | int btrfs_add_ordered_sum(struct inode *inode, |
123 | struct btrfs_ordered_extent *entry, | |
124 | struct btrfs_ordered_sum *sum); | |
e6dcd2dc CM |
125 | struct btrfs_ordered_extent *btrfs_lookup_ordered_extent(struct inode *inode, |
126 | u64 file_offset); | |
eb84ae03 CM |
127 | void btrfs_start_ordered_extent(struct inode *inode, |
128 | struct btrfs_ordered_extent *entry, int wait); | |
e6dcd2dc CM |
129 | void btrfs_wait_ordered_range(struct inode *inode, u64 start, u64 len); |
130 | struct btrfs_ordered_extent * | |
131 | btrfs_lookup_first_ordered_extent(struct inode * inode, u64 file_offset); | |
dbe674a9 CM |
132 | int btrfs_ordered_update_i_size(struct inode *inode, |
133 | struct btrfs_ordered_extent *ordered); | |
ba1da2f4 | 134 | int btrfs_find_ordered_sum(struct inode *inode, u64 offset, u32 *sum); |
dc17ff8f | 135 | #endif |