Commit | Line | Data |
---|---|---|
ccd979bd MF |
1 | /* -*- mode: c; c-basic-offset: 8; -*- |
2 | * vim: noexpandtab sw=8 ts=8 sts=0: | |
3 | * | |
4 | * alloc.h | |
5 | * | |
6 | * Function prototypes | |
7 | * | |
8 | * Copyright (C) 2002, 2004 Oracle. All rights reserved. | |
9 | * | |
10 | * This program is free software; you can redistribute it and/or | |
11 | * modify it under the terms of the GNU General Public | |
12 | * License as published by the Free Software Foundation; either | |
13 | * version 2 of the License, or (at your option) any later version. | |
14 | * | |
15 | * This program is distributed in the hope that it will be useful, | |
16 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
17 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
18 | * General Public License for more details. | |
19 | * | |
20 | * You should have received a copy of the GNU General Public | |
21 | * License along with this program; if not, write to the | |
22 | * Free Software Foundation, Inc., 59 Temple Place - Suite 330, | |
23 | * Boston, MA 021110-1307, USA. | |
24 | */ | |
25 | ||
26 | #ifndef OCFS2_ALLOC_H | |
27 | #define OCFS2_ALLOC_H | |
28 | ||
e7d4cb6b | 29 | |
ca12b7c4 TM |
30 | /* |
31 | * For xattr tree leaf, we limit the leaf byte size to be 64K. | |
32 | */ | |
33 | #define OCFS2_MAX_XATTR_TREE_LEAF_SIZE 65536 | |
34 | ||
f99b9b7c JB |
35 | /* |
36 | * ocfs2_extent_tree and ocfs2_extent_tree_operations are used to abstract | |
37 | * the b-tree operations in ocfs2. Now all the b-tree operations are not | |
38 | * limited to ocfs2_dinode only. Any data which need to allocate clusters | |
39 | * to store can use b-tree. And it only needs to implement its ocfs2_extent_tree | |
40 | * and operation. | |
41 | * | |
42 | * ocfs2_extent_tree becomes the first-class object for extent tree | |
43 | * manipulation. Callers of the alloc.c code need to fill it via one of | |
8d6220d6 | 44 | * the ocfs2_init_*_extent_tree() operations below. |
f99b9b7c JB |
45 | * |
46 | * ocfs2_extent_tree contains info for the root of the b-tree, it must have a | |
47 | * root ocfs2_extent_list and a root_bh so that they can be used in the b-tree | |
48 | * functions. | |
49 | * ocfs2_extent_tree_operations abstract the normal operations we do for | |
50 | * the root of extent b-tree. | |
51 | */ | |
52 | struct ocfs2_extent_tree_operations; | |
53 | struct ocfs2_extent_tree { | |
54 | struct ocfs2_extent_tree_operations *et_ops; | |
55 | struct buffer_head *et_root_bh; | |
56 | struct ocfs2_extent_list *et_root_el; | |
57 | void *et_object; | |
58 | unsigned int et_max_leaf_clusters; | |
59 | }; | |
60 | ||
61 | /* | |
8d6220d6 JB |
62 | * ocfs2_init_*_extent_tree() will fill an ocfs2_extent_tree from the |
63 | * specified object buffer. | |
f99b9b7c | 64 | */ |
8d6220d6 JB |
65 | void ocfs2_init_dinode_extent_tree(struct ocfs2_extent_tree *et, |
66 | struct inode *inode, | |
67 | struct buffer_head *bh); | |
68 | void ocfs2_init_xattr_tree_extent_tree(struct ocfs2_extent_tree *et, | |
f99b9b7c | 69 | struct inode *inode, |
8d6220d6 JB |
70 | struct buffer_head *bh); |
71 | void ocfs2_init_xattr_value_extent_tree(struct ocfs2_extent_tree *et, | |
72 | struct inode *inode, | |
73 | struct buffer_head *bh, | |
74 | struct ocfs2_xattr_value_root *xv); | |
f99b9b7c | 75 | |
ccd979bd | 76 | struct ocfs2_alloc_context; |
f99b9b7c JB |
77 | int ocfs2_insert_extent(struct ocfs2_super *osb, |
78 | handle_t *handle, | |
79 | struct inode *inode, | |
80 | struct ocfs2_extent_tree *et, | |
81 | u32 cpos, | |
82 | u64 start_blk, | |
83 | u32 new_clusters, | |
84 | u8 flags, | |
85 | struct ocfs2_alloc_context *meta_ac); | |
86 | ||
0eb8d47e TM |
87 | enum ocfs2_alloc_restarted { |
88 | RESTART_NONE = 0, | |
89 | RESTART_TRANS, | |
90 | RESTART_META | |
91 | }; | |
92 | int ocfs2_add_clusters_in_btree(struct ocfs2_super *osb, | |
93 | struct inode *inode, | |
94 | u32 *logical_offset, | |
95 | u32 clusters_to_add, | |
96 | int mark_unwritten, | |
f99b9b7c | 97 | struct ocfs2_extent_tree *et, |
0eb8d47e TM |
98 | handle_t *handle, |
99 | struct ocfs2_alloc_context *data_ac, | |
100 | struct ocfs2_alloc_context *meta_ac, | |
f99b9b7c | 101 | enum ocfs2_alloc_restarted *reason_ret); |
328d5752 | 102 | struct ocfs2_cached_dealloc_ctxt; |
f99b9b7c JB |
103 | int ocfs2_mark_extent_written(struct inode *inode, |
104 | struct ocfs2_extent_tree *et, | |
328d5752 MF |
105 | handle_t *handle, u32 cpos, u32 len, u32 phys, |
106 | struct ocfs2_alloc_context *meta_ac, | |
f99b9b7c JB |
107 | struct ocfs2_cached_dealloc_ctxt *dealloc); |
108 | int ocfs2_remove_extent(struct inode *inode, | |
109 | struct ocfs2_extent_tree *et, | |
063c4561 MF |
110 | u32 cpos, u32 len, handle_t *handle, |
111 | struct ocfs2_alloc_context *meta_ac, | |
f99b9b7c | 112 | struct ocfs2_cached_dealloc_ctxt *dealloc); |
ccd979bd MF |
113 | int ocfs2_num_free_extents(struct ocfs2_super *osb, |
114 | struct inode *inode, | |
f99b9b7c | 115 | struct ocfs2_extent_tree *et); |
e7d4cb6b | 116 | |
811f933d TM |
117 | /* |
118 | * how many new metadata chunks would an allocation need at maximum? | |
119 | * | |
120 | * Please note that the caller must make sure that root_el is the root | |
121 | * of extent tree. So for an inode, it should be &fe->id2.i_list. Otherwise | |
122 | * the result may be wrong. | |
123 | */ | |
124 | static inline int ocfs2_extend_meta_needed(struct ocfs2_extent_list *root_el) | |
ccd979bd MF |
125 | { |
126 | /* | |
127 | * Rather than do all the work of determining how much we need | |
128 | * (involves a ton of reads and locks), just ask for the | |
129 | * maximal limit. That's a tree depth shift. So, one block for | |
130 | * level of the tree (current l_tree_depth), one block for the | |
131 | * new tree_depth==0 extent_block, and one block at the new | |
132 | * top-of-the tree. | |
133 | */ | |
811f933d | 134 | return le16_to_cpu(root_el->l_tree_depth) + 2; |
ccd979bd MF |
135 | } |
136 | ||
5b6a3a2b | 137 | void ocfs2_dinode_new_extent_list(struct inode *inode, struct ocfs2_dinode *di); |
1afc32b9 MF |
138 | void ocfs2_set_inode_data_inline(struct inode *inode, struct ocfs2_dinode *di); |
139 | int ocfs2_convert_inline_data_to_extents(struct inode *inode, | |
140 | struct buffer_head *di_bh); | |
141 | ||
ccd979bd MF |
142 | int ocfs2_truncate_log_init(struct ocfs2_super *osb); |
143 | void ocfs2_truncate_log_shutdown(struct ocfs2_super *osb); | |
144 | void ocfs2_schedule_truncate_log_flush(struct ocfs2_super *osb, | |
145 | int cancel); | |
146 | int ocfs2_flush_truncate_log(struct ocfs2_super *osb); | |
147 | int ocfs2_begin_truncate_log_recovery(struct ocfs2_super *osb, | |
148 | int slot_num, | |
149 | struct ocfs2_dinode **tl_copy); | |
150 | int ocfs2_complete_truncate_log_recovery(struct ocfs2_super *osb, | |
151 | struct ocfs2_dinode *tl_copy); | |
063c4561 MF |
152 | int ocfs2_truncate_log_needs_flush(struct ocfs2_super *osb); |
153 | int ocfs2_truncate_log_append(struct ocfs2_super *osb, | |
154 | handle_t *handle, | |
155 | u64 start_blk, | |
156 | unsigned int num_clusters); | |
157 | int __ocfs2_flush_truncate_log(struct ocfs2_super *osb); | |
ccd979bd | 158 | |
2b604351 MF |
159 | /* |
160 | * Process local structure which describes the block unlinks done | |
161 | * during an operation. This is populated via | |
162 | * ocfs2_cache_block_dealloc(). | |
163 | * | |
164 | * ocfs2_run_deallocs() should be called after the potentially | |
165 | * de-allocating routines. No journal handles should be open, and most | |
166 | * locks should have been dropped. | |
167 | */ | |
168 | struct ocfs2_cached_dealloc_ctxt { | |
169 | struct ocfs2_per_slot_free_list *c_first_suballocator; | |
170 | }; | |
171 | static inline void ocfs2_init_dealloc_ctxt(struct ocfs2_cached_dealloc_ctxt *c) | |
172 | { | |
173 | c->c_first_suballocator = NULL; | |
174 | } | |
175 | int ocfs2_run_deallocs(struct ocfs2_super *osb, | |
176 | struct ocfs2_cached_dealloc_ctxt *ctxt); | |
177 | ||
ccd979bd | 178 | struct ocfs2_truncate_context { |
59a5e416 | 179 | struct ocfs2_cached_dealloc_ctxt tc_dealloc; |
ccd979bd MF |
180 | int tc_ext_alloc_locked; /* is it cluster locked? */ |
181 | /* these get destroyed once it's passed to ocfs2_commit_truncate. */ | |
182 | struct buffer_head *tc_last_eb_bh; | |
183 | }; | |
184 | ||
35edec1d MF |
185 | int ocfs2_zero_range_for_truncate(struct inode *inode, handle_t *handle, |
186 | u64 range_start, u64 range_end); | |
ccd979bd MF |
187 | int ocfs2_prepare_truncate(struct ocfs2_super *osb, |
188 | struct inode *inode, | |
189 | struct buffer_head *fe_bh, | |
190 | struct ocfs2_truncate_context **tc); | |
191 | int ocfs2_commit_truncate(struct ocfs2_super *osb, | |
192 | struct inode *inode, | |
193 | struct buffer_head *fe_bh, | |
194 | struct ocfs2_truncate_context *tc); | |
1afc32b9 MF |
195 | int ocfs2_truncate_inline(struct inode *inode, struct buffer_head *di_bh, |
196 | unsigned int start, unsigned int end, int trunc); | |
ccd979bd | 197 | |
363041a5 MF |
198 | int ocfs2_find_leaf(struct inode *inode, struct ocfs2_extent_list *root_el, |
199 | u32 cpos, struct buffer_head **leaf_bh); | |
328d5752 | 200 | int ocfs2_search_extent_list(struct ocfs2_extent_list *el, u32 v_cluster); |
363041a5 | 201 | |
e48edee2 MF |
202 | /* |
203 | * Helper function to look at the # of clusters in an extent record. | |
204 | */ | |
205 | static inline unsigned int ocfs2_rec_clusters(struct ocfs2_extent_list *el, | |
206 | struct ocfs2_extent_rec *rec) | |
207 | { | |
208 | /* | |
209 | * Cluster count in extent records is slightly different | |
210 | * between interior nodes and leaf nodes. This is to support | |
211 | * unwritten extents which need a flags field in leaf node | |
212 | * records, thus shrinking the available space for a clusters | |
213 | * field. | |
214 | */ | |
215 | if (el->l_tree_depth) | |
216 | return le32_to_cpu(rec->e_int_clusters); | |
217 | else | |
218 | return le16_to_cpu(rec->e_leaf_clusters); | |
219 | } | |
220 | ||
00dc417f MF |
221 | /* |
222 | * This is only valid for leaf nodes, which are the only ones that can | |
223 | * have empty extents anyway. | |
224 | */ | |
225 | static inline int ocfs2_is_empty_extent(struct ocfs2_extent_rec *rec) | |
226 | { | |
227 | return !rec->e_leaf_clusters; | |
228 | } | |
229 | ||
ccd979bd | 230 | #endif /* OCFS2_ALLOC_H */ |