Blame view
fs/ocfs2/alloc.c
190 KB
ccd979bdb [PATCH] OCFS2: Th... |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 |
/* -*- mode: c; c-basic-offset: 8; -*- * vim: noexpandtab sw=8 ts=8 sts=0: * * alloc.c * * Extent allocs and frees * * Copyright (C) 2002, 2004 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 as published by the Free Software Foundation; either * version 2 of the License, or (at your option) any later version. * * 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. */ #include <linux/fs.h> #include <linux/types.h> #include <linux/slab.h> #include <linux/highmem.h> |
60b11392f ocfs2: zero tail ... |
30 |
#include <linux/swap.h> |
a90714c15 ocfs2: Add quota ... |
31 |
#include <linux/quotaops.h> |
e80de36d8 ocfs2: Add ocfs2_... |
32 |
#include <linux/blkdev.h> |
174cd4b1e sched/headers: Pr... |
33 |
#include <linux/sched/signal.h> |
ccd979bdb [PATCH] OCFS2: Th... |
34 |
|
ccd979bdb [PATCH] OCFS2: Th... |
35 36 37 38 39 |
#include <cluster/masklog.h> #include "ocfs2.h" #include "alloc.h" |
60b11392f ocfs2: zero tail ... |
40 |
#include "aops.h" |
d6b32bbb3 ocfs2: block read... |
41 |
#include "blockcheck.h" |
ccd979bdb [PATCH] OCFS2: Th... |
42 43 44 45 46 47 48 49 50 51 |
#include "dlmglue.h" #include "extent_map.h" #include "inode.h" #include "journal.h" #include "localalloc.h" #include "suballoc.h" #include "sysfile.h" #include "file.h" #include "super.h" #include "uptodate.h" |
2a50a743b ocfs2: Create ocf... |
52 |
#include "xattr.h" |
bcbbb24a6 ocfs2: Decrement ... |
53 |
#include "refcounttree.h" |
a09d09b8f ocfs2: Remove mlo... |
54 |
#include "ocfs2_trace.h" |
ccd979bdb [PATCH] OCFS2: Th... |
55 56 |
#include "buffer_head_io.h" |
853a3a143 ocfs2: Wrap ocfs2... |
57 58 59 60 61 62 |
enum ocfs2_contig_type { CONTIG_NONE = 0, CONTIG_LEFT, CONTIG_RIGHT, CONTIG_LEFTRIGHT, }; |
e7d4cb6bc ocfs2: Abstract o... |
63 |
|
853a3a143 ocfs2: Wrap ocfs2... |
64 65 66 67 |
static enum ocfs2_contig_type ocfs2_extent_rec_contig(struct super_block *sb, struct ocfs2_extent_rec *ext, struct ocfs2_extent_rec *insert_rec); |
1625f8ac1 ocfs2: Comment st... |
68 69 70 71 72 |
/* * Operations for a specific extent tree type. * * To implement an on-disk btree (extent tree) type in ocfs2, add * an ocfs2_extent_tree_operations structure and the matching |
8d6220d6a ocfs2: Change ocf... |
73 |
* ocfs2_init_<thingy>_extent_tree() function. That's pretty much it |
1625f8ac1 ocfs2: Comment st... |
74 75 |
* for the allocation portion of the extent tree. */ |
e7d4cb6bc ocfs2: Abstract o... |
76 |
struct ocfs2_extent_tree_operations { |
1625f8ac1 ocfs2: Comment st... |
77 78 79 80 81 82 83 |
/* * last_eb_blk is the block number of the right most leaf extent * block. Most on-disk structures containing an extent tree store * this value for fast access. The ->eo_set_last_eb_blk() and * ->eo_get_last_eb_blk() operations access this value. They are * both required. */ |
35dc0aa3c ocfs2: Prefix the... |
84 85 86 |
void (*eo_set_last_eb_blk)(struct ocfs2_extent_tree *et, u64 blkno); u64 (*eo_get_last_eb_blk)(struct ocfs2_extent_tree *et); |
1625f8ac1 ocfs2: Comment st... |
87 88 89 90 91 92 93 |
/* * The on-disk structure usually keeps track of how many total * clusters are stored in this extent tree. This function updates * that value. new_clusters is the delta, and must be * added to the total. Required. */ |
6136ca5f5 ocfs2: Drop struc... |
94 |
void (*eo_update_clusters)(struct ocfs2_extent_tree *et, |
35dc0aa3c ocfs2: Prefix the... |
95 |
u32 new_clusters); |
1625f8ac1 ocfs2: Comment st... |
96 97 |
/* |
92ba470c4 ocfs2: Make exten... |
98 99 100 101 102 103 104 |
* If this extent tree is supported by an extent map, insert * a record into the map. */ void (*eo_extent_map_insert)(struct ocfs2_extent_tree *et, struct ocfs2_extent_rec *rec); /* |
4c911eefc ocfs2: Make trunc... |
105 106 107 108 109 110 111 |
* If this extent tree is supported by an extent map, truncate the * map to clusters, */ void (*eo_extent_map_truncate)(struct ocfs2_extent_tree *et, u32 clusters); /* |
1625f8ac1 ocfs2: Comment st... |
112 113 114 |
* If ->eo_insert_check() exists, it is called before rec is * inserted into the extent tree. It is optional. */ |
6136ca5f5 ocfs2: Drop struc... |
115 |
int (*eo_insert_check)(struct ocfs2_extent_tree *et, |
1e61ee79e ocfs2: Add an ins... |
116 |
struct ocfs2_extent_rec *rec); |
6136ca5f5 ocfs2: Drop struc... |
117 |
int (*eo_sanity_check)(struct ocfs2_extent_tree *et); |
0ce1010f1 ocfs2: Provide th... |
118 |
|
1625f8ac1 ocfs2: Comment st... |
119 120 121 122 123 124 125 126 127 128 |
/* * -------------------------------------------------------------- * The remaining are internal to ocfs2_extent_tree and don't have * accessor functions */ /* * ->eo_fill_root_el() takes et->et_object and sets et->et_root_el. * It is required. */ |
0ce1010f1 ocfs2: Provide th... |
129 |
void (*eo_fill_root_el)(struct ocfs2_extent_tree *et); |
1625f8ac1 ocfs2: Comment st... |
130 131 132 133 134 135 |
/* * ->eo_fill_max_leaf_clusters sets et->et_max_leaf_clusters if * it exists. If it does not, et->et_max_leaf_clusters is set * to 0 (unlimited). Optional. */ |
6136ca5f5 ocfs2: Drop struc... |
136 |
void (*eo_fill_max_leaf_clusters)(struct ocfs2_extent_tree *et); |
853a3a143 ocfs2: Wrap ocfs2... |
137 138 139 140 141 142 143 144 145 146 |
/* * ->eo_extent_contig test whether the 2 ocfs2_extent_rec * are contiguous or not. Optional. Don't need to set it if use * ocfs2_extent_rec as the tree leaf. */ enum ocfs2_contig_type (*eo_extent_contig)(struct ocfs2_extent_tree *et, struct ocfs2_extent_rec *ext, struct ocfs2_extent_rec *insert_rec); |
e7d4cb6bc ocfs2: Abstract o... |
147 |
}; |
e7d4cb6bc ocfs2: Abstract o... |
148 |
|
f99b9b7cc ocfs2: Make ocfs2... |
149 150 151 152 153 154 155 |
/* * Pre-declare ocfs2_dinode_et_ops so we can use it as a sanity check * in the methods. */ static u64 ocfs2_dinode_get_last_eb_blk(struct ocfs2_extent_tree *et); static void ocfs2_dinode_set_last_eb_blk(struct ocfs2_extent_tree *et, u64 blkno); |
6136ca5f5 ocfs2: Drop struc... |
156 |
static void ocfs2_dinode_update_clusters(struct ocfs2_extent_tree *et, |
f99b9b7cc ocfs2: Make ocfs2... |
157 |
u32 clusters); |
92ba470c4 ocfs2: Make exten... |
158 159 |
static void ocfs2_dinode_extent_map_insert(struct ocfs2_extent_tree *et, struct ocfs2_extent_rec *rec); |
4c911eefc ocfs2: Make trunc... |
160 161 |
static void ocfs2_dinode_extent_map_truncate(struct ocfs2_extent_tree *et, u32 clusters); |
6136ca5f5 ocfs2: Drop struc... |
162 |
static int ocfs2_dinode_insert_check(struct ocfs2_extent_tree *et, |
f99b9b7cc ocfs2: Make ocfs2... |
163 |
struct ocfs2_extent_rec *rec); |
6136ca5f5 ocfs2: Drop struc... |
164 |
static int ocfs2_dinode_sanity_check(struct ocfs2_extent_tree *et); |
f99b9b7cc ocfs2: Make ocfs2... |
165 |
static void ocfs2_dinode_fill_root_el(struct ocfs2_extent_tree *et); |
9e62dc096 ocfs2: constify o... |
166 |
static const struct ocfs2_extent_tree_operations ocfs2_dinode_et_ops = { |
f99b9b7cc ocfs2: Make ocfs2... |
167 168 169 |
.eo_set_last_eb_blk = ocfs2_dinode_set_last_eb_blk, .eo_get_last_eb_blk = ocfs2_dinode_get_last_eb_blk, .eo_update_clusters = ocfs2_dinode_update_clusters, |
92ba470c4 ocfs2: Make exten... |
170 |
.eo_extent_map_insert = ocfs2_dinode_extent_map_insert, |
4c911eefc ocfs2: Make trunc... |
171 |
.eo_extent_map_truncate = ocfs2_dinode_extent_map_truncate, |
f99b9b7cc ocfs2: Make ocfs2... |
172 173 174 175 |
.eo_insert_check = ocfs2_dinode_insert_check, .eo_sanity_check = ocfs2_dinode_sanity_check, .eo_fill_root_el = ocfs2_dinode_fill_root_el, }; |
0ce1010f1 ocfs2: Provide th... |
176 |
|
e7d4cb6bc ocfs2: Abstract o... |
177 178 179 |
static void ocfs2_dinode_set_last_eb_blk(struct ocfs2_extent_tree *et, u64 blkno) { |
ea5efa151 ocfs2: Make 'priv... |
180 |
struct ocfs2_dinode *di = et->et_object; |
e7d4cb6bc ocfs2: Abstract o... |
181 |
|
f99b9b7cc ocfs2: Make ocfs2... |
182 |
BUG_ON(et->et_ops != &ocfs2_dinode_et_ops); |
e7d4cb6bc ocfs2: Abstract o... |
183 184 185 186 187 |
di->i_last_eb_blk = cpu_to_le64(blkno); } static u64 ocfs2_dinode_get_last_eb_blk(struct ocfs2_extent_tree *et) { |
ea5efa151 ocfs2: Make 'priv... |
188 |
struct ocfs2_dinode *di = et->et_object; |
e7d4cb6bc ocfs2: Abstract o... |
189 |
|
f99b9b7cc ocfs2: Make ocfs2... |
190 |
BUG_ON(et->et_ops != &ocfs2_dinode_et_ops); |
e7d4cb6bc ocfs2: Abstract o... |
191 192 |
return le64_to_cpu(di->i_last_eb_blk); } |
6136ca5f5 ocfs2: Drop struc... |
193 |
static void ocfs2_dinode_update_clusters(struct ocfs2_extent_tree *et, |
e7d4cb6bc ocfs2: Abstract o... |
194 195 |
u32 clusters) { |
6136ca5f5 ocfs2: Drop struc... |
196 |
struct ocfs2_inode_info *oi = cache_info_to_inode(et->et_ci); |
ea5efa151 ocfs2: Make 'priv... |
197 |
struct ocfs2_dinode *di = et->et_object; |
e7d4cb6bc ocfs2: Abstract o... |
198 199 |
le32_add_cpu(&di->i_clusters, clusters); |
6136ca5f5 ocfs2: Drop struc... |
200 201 202 |
spin_lock(&oi->ip_lock); oi->ip_clusters = le32_to_cpu(di->i_clusters); spin_unlock(&oi->ip_lock); |
e7d4cb6bc ocfs2: Abstract o... |
203 |
} |
92ba470c4 ocfs2: Make exten... |
204 205 206 207 208 209 210 |
static void ocfs2_dinode_extent_map_insert(struct ocfs2_extent_tree *et, struct ocfs2_extent_rec *rec) { struct inode *inode = &cache_info_to_inode(et->et_ci)->vfs_inode; ocfs2_extent_map_insert_rec(inode, rec); } |
4c911eefc ocfs2: Make trunc... |
211 212 213 214 215 216 217 |
static void ocfs2_dinode_extent_map_truncate(struct ocfs2_extent_tree *et, u32 clusters) { struct inode *inode = &cache_info_to_inode(et->et_ci)->vfs_inode; ocfs2_extent_map_trunc(inode, clusters); } |
6136ca5f5 ocfs2: Drop struc... |
218 |
static int ocfs2_dinode_insert_check(struct ocfs2_extent_tree *et, |
1e61ee79e ocfs2: Add an ins... |
219 220 |
struct ocfs2_extent_rec *rec) { |
6136ca5f5 ocfs2: Drop struc... |
221 222 |
struct ocfs2_inode_info *oi = cache_info_to_inode(et->et_ci); struct ocfs2_super *osb = OCFS2_SB(oi->vfs_inode.i_sb); |
1e61ee79e ocfs2: Add an ins... |
223 |
|
6136ca5f5 ocfs2: Drop struc... |
224 |
BUG_ON(oi->ip_dyn_features & OCFS2_INLINE_DATA_FL); |
1e61ee79e ocfs2: Add an ins... |
225 |
mlog_bug_on_msg(!ocfs2_sparse_alloc(osb) && |
6136ca5f5 ocfs2: Drop struc... |
226 |
(oi->ip_clusters != le32_to_cpu(rec->e_cpos)), |
1e61ee79e ocfs2: Add an ins... |
227 228 229 230 |
"Device %s, asking for sparse allocation: inode %llu, " "cpos %u, clusters %u ", osb->dev_str, |
6136ca5f5 ocfs2: Drop struc... |
231 232 |
(unsigned long long)oi->ip_blkno, rec->e_cpos, oi->ip_clusters); |
1e61ee79e ocfs2: Add an ins... |
233 234 235 |
return 0; } |
6136ca5f5 ocfs2: Drop struc... |
236 |
static int ocfs2_dinode_sanity_check(struct ocfs2_extent_tree *et) |
e7d4cb6bc ocfs2: Abstract o... |
237 |
{ |
10995aa24 ocfs2: Morph the ... |
238 |
struct ocfs2_dinode *di = et->et_object; |
e7d4cb6bc ocfs2: Abstract o... |
239 |
|
f99b9b7cc ocfs2: Make ocfs2... |
240 |
BUG_ON(et->et_ops != &ocfs2_dinode_et_ops); |
10995aa24 ocfs2: Morph the ... |
241 |
BUG_ON(!OCFS2_IS_VALID_DINODE(di)); |
e7d4cb6bc ocfs2: Abstract o... |
242 |
|
10995aa24 ocfs2: Morph the ... |
243 |
return 0; |
e7d4cb6bc ocfs2: Abstract o... |
244 |
} |
f99b9b7cc ocfs2: Make ocfs2... |
245 246 247 248 249 250 |
static void ocfs2_dinode_fill_root_el(struct ocfs2_extent_tree *et) { struct ocfs2_dinode *di = et->et_object; et->et_root_el = &di->id2.i_list; } |
e7d4cb6bc ocfs2: Abstract o... |
251 |
|
0ce1010f1 ocfs2: Provide th... |
252 253 |
static void ocfs2_xattr_value_fill_root_el(struct ocfs2_extent_tree *et) { |
2a50a743b ocfs2: Create ocf... |
254 |
struct ocfs2_xattr_value_buf *vb = et->et_object; |
0ce1010f1 ocfs2: Provide th... |
255 |
|
2a50a743b ocfs2: Create ocf... |
256 |
et->et_root_el = &vb->vb_xv->xr_list; |
0ce1010f1 ocfs2: Provide th... |
257 |
} |
f56654c43 ocfs2: Add extent... |
258 259 260 |
static void ocfs2_xattr_value_set_last_eb_blk(struct ocfs2_extent_tree *et, u64 blkno) { |
2a50a743b ocfs2: Create ocf... |
261 |
struct ocfs2_xattr_value_buf *vb = et->et_object; |
f56654c43 ocfs2: Add extent... |
262 |
|
2a50a743b ocfs2: Create ocf... |
263 |
vb->vb_xv->xr_last_eb_blk = cpu_to_le64(blkno); |
f56654c43 ocfs2: Add extent... |
264 265 266 267 |
} static u64 ocfs2_xattr_value_get_last_eb_blk(struct ocfs2_extent_tree *et) { |
2a50a743b ocfs2: Create ocf... |
268 |
struct ocfs2_xattr_value_buf *vb = et->et_object; |
f56654c43 ocfs2: Add extent... |
269 |
|
2a50a743b ocfs2: Create ocf... |
270 |
return le64_to_cpu(vb->vb_xv->xr_last_eb_blk); |
f56654c43 ocfs2: Add extent... |
271 |
} |
6136ca5f5 ocfs2: Drop struc... |
272 |
static void ocfs2_xattr_value_update_clusters(struct ocfs2_extent_tree *et, |
f56654c43 ocfs2: Add extent... |
273 274 |
u32 clusters) { |
2a50a743b ocfs2: Create ocf... |
275 |
struct ocfs2_xattr_value_buf *vb = et->et_object; |
f56654c43 ocfs2: Add extent... |
276 |
|
2a50a743b ocfs2: Create ocf... |
277 |
le32_add_cpu(&vb->vb_xv->xr_clusters, clusters); |
f56654c43 ocfs2: Add extent... |
278 |
} |
9e62dc096 ocfs2: constify o... |
279 |
static const struct ocfs2_extent_tree_operations ocfs2_xattr_value_et_ops = { |
35dc0aa3c ocfs2: Prefix the... |
280 281 282 |
.eo_set_last_eb_blk = ocfs2_xattr_value_set_last_eb_blk, .eo_get_last_eb_blk = ocfs2_xattr_value_get_last_eb_blk, .eo_update_clusters = ocfs2_xattr_value_update_clusters, |
0ce1010f1 ocfs2: Provide th... |
283 |
.eo_fill_root_el = ocfs2_xattr_value_fill_root_el, |
f56654c43 ocfs2: Add extent... |
284 |
}; |
0ce1010f1 ocfs2: Provide th... |
285 286 287 288 289 290 |
static void ocfs2_xattr_tree_fill_root_el(struct ocfs2_extent_tree *et) { struct ocfs2_xattr_block *xb = et->et_object; et->et_root_el = &xb->xb_attrs.xb_root.xt_list; } |
6136ca5f5 ocfs2: Drop struc... |
291 |
static void ocfs2_xattr_tree_fill_max_leaf_clusters(struct ocfs2_extent_tree *et) |
943cced39 ocfs2: Determine ... |
292 |
{ |
6136ca5f5 ocfs2: Drop struc... |
293 |
struct super_block *sb = ocfs2_metadata_cache_get_super(et->et_ci); |
943cced39 ocfs2: Determine ... |
294 |
et->et_max_leaf_clusters = |
6136ca5f5 ocfs2: Drop struc... |
295 |
ocfs2_clusters_for_bytes(sb, OCFS2_MAX_XATTR_TREE_LEAF_SIZE); |
943cced39 ocfs2: Determine ... |
296 |
} |
ba492615f ocfs2: Add xattr ... |
297 298 299 |
static void ocfs2_xattr_tree_set_last_eb_blk(struct ocfs2_extent_tree *et, u64 blkno) { |
ea5efa151 ocfs2: Make 'priv... |
300 |
struct ocfs2_xattr_block *xb = et->et_object; |
ba492615f ocfs2: Add xattr ... |
301 302 303 304 305 306 307 |
struct ocfs2_xattr_tree_root *xt = &xb->xb_attrs.xb_root; xt->xt_last_eb_blk = cpu_to_le64(blkno); } static u64 ocfs2_xattr_tree_get_last_eb_blk(struct ocfs2_extent_tree *et) { |
ea5efa151 ocfs2: Make 'priv... |
308 |
struct ocfs2_xattr_block *xb = et->et_object; |
ba492615f ocfs2: Add xattr ... |
309 310 311 312 |
struct ocfs2_xattr_tree_root *xt = &xb->xb_attrs.xb_root; return le64_to_cpu(xt->xt_last_eb_blk); } |
6136ca5f5 ocfs2: Drop struc... |
313 |
static void ocfs2_xattr_tree_update_clusters(struct ocfs2_extent_tree *et, |
ba492615f ocfs2: Add xattr ... |
314 315 |
u32 clusters) { |
ea5efa151 ocfs2: Make 'priv... |
316 |
struct ocfs2_xattr_block *xb = et->et_object; |
ba492615f ocfs2: Add xattr ... |
317 318 319 |
le32_add_cpu(&xb->xb_attrs.xb_root.xt_clusters, clusters); } |
9e62dc096 ocfs2: constify o... |
320 |
static const struct ocfs2_extent_tree_operations ocfs2_xattr_tree_et_ops = { |
35dc0aa3c ocfs2: Prefix the... |
321 322 323 |
.eo_set_last_eb_blk = ocfs2_xattr_tree_set_last_eb_blk, .eo_get_last_eb_blk = ocfs2_xattr_tree_get_last_eb_blk, .eo_update_clusters = ocfs2_xattr_tree_update_clusters, |
0ce1010f1 ocfs2: Provide th... |
324 |
.eo_fill_root_el = ocfs2_xattr_tree_fill_root_el, |
943cced39 ocfs2: Determine ... |
325 |
.eo_fill_max_leaf_clusters = ocfs2_xattr_tree_fill_max_leaf_clusters, |
ba492615f ocfs2: Add xattr ... |
326 |
}; |
9b7895efa ocfs2: Add a name... |
327 328 329 330 331 332 333 334 335 336 337 338 339 340 |
static void ocfs2_dx_root_set_last_eb_blk(struct ocfs2_extent_tree *et, u64 blkno) { struct ocfs2_dx_root_block *dx_root = et->et_object; dx_root->dr_last_eb_blk = cpu_to_le64(blkno); } static u64 ocfs2_dx_root_get_last_eb_blk(struct ocfs2_extent_tree *et) { struct ocfs2_dx_root_block *dx_root = et->et_object; return le64_to_cpu(dx_root->dr_last_eb_blk); } |
6136ca5f5 ocfs2: Drop struc... |
341 |
static void ocfs2_dx_root_update_clusters(struct ocfs2_extent_tree *et, |
9b7895efa ocfs2: Add a name... |
342 343 344 345 346 347 |
u32 clusters) { struct ocfs2_dx_root_block *dx_root = et->et_object; le32_add_cpu(&dx_root->dr_clusters, clusters); } |
6136ca5f5 ocfs2: Drop struc... |
348 |
static int ocfs2_dx_root_sanity_check(struct ocfs2_extent_tree *et) |
9b7895efa ocfs2: Add a name... |
349 350 351 352 353 354 355 356 357 358 359 360 361 362 |
{ struct ocfs2_dx_root_block *dx_root = et->et_object; BUG_ON(!OCFS2_IS_VALID_DX_ROOT(dx_root)); return 0; } static void ocfs2_dx_root_fill_root_el(struct ocfs2_extent_tree *et) { struct ocfs2_dx_root_block *dx_root = et->et_object; et->et_root_el = &dx_root->dr_list; } |
9e62dc096 ocfs2: constify o... |
363 |
static const struct ocfs2_extent_tree_operations ocfs2_dx_root_et_ops = { |
9b7895efa ocfs2: Add a name... |
364 365 366 367 368 369 |
.eo_set_last_eb_blk = ocfs2_dx_root_set_last_eb_blk, .eo_get_last_eb_blk = ocfs2_dx_root_get_last_eb_blk, .eo_update_clusters = ocfs2_dx_root_update_clusters, .eo_sanity_check = ocfs2_dx_root_sanity_check, .eo_fill_root_el = ocfs2_dx_root_fill_root_el, }; |
fe9244159 ocfs2: Add refcou... |
370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 |
static void ocfs2_refcount_tree_fill_root_el(struct ocfs2_extent_tree *et) { struct ocfs2_refcount_block *rb = et->et_object; et->et_root_el = &rb->rf_list; } static void ocfs2_refcount_tree_set_last_eb_blk(struct ocfs2_extent_tree *et, u64 blkno) { struct ocfs2_refcount_block *rb = et->et_object; rb->rf_last_eb_blk = cpu_to_le64(blkno); } static u64 ocfs2_refcount_tree_get_last_eb_blk(struct ocfs2_extent_tree *et) { struct ocfs2_refcount_block *rb = et->et_object; return le64_to_cpu(rb->rf_last_eb_blk); } static void ocfs2_refcount_tree_update_clusters(struct ocfs2_extent_tree *et, u32 clusters) { struct ocfs2_refcount_block *rb = et->et_object; le32_add_cpu(&rb->rf_clusters, clusters); } static enum ocfs2_contig_type ocfs2_refcount_tree_extent_contig(struct ocfs2_extent_tree *et, struct ocfs2_extent_rec *ext, struct ocfs2_extent_rec *insert_rec) { return CONTIG_NONE; } |
9e62dc096 ocfs2: constify o... |
407 |
static const struct ocfs2_extent_tree_operations ocfs2_refcount_tree_et_ops = { |
fe9244159 ocfs2: Add refcou... |
408 409 410 411 412 413 |
.eo_set_last_eb_blk = ocfs2_refcount_tree_set_last_eb_blk, .eo_get_last_eb_blk = ocfs2_refcount_tree_get_last_eb_blk, .eo_update_clusters = ocfs2_refcount_tree_update_clusters, .eo_fill_root_el = ocfs2_refcount_tree_fill_root_el, .eo_extent_contig = ocfs2_refcount_tree_extent_contig, }; |
8d6220d6a ocfs2: Change ocf... |
414 |
static void __ocfs2_init_extent_tree(struct ocfs2_extent_tree *et, |
5e404e9ed ocfs2: Pass ocfs2... |
415 |
struct ocfs2_caching_info *ci, |
8d6220d6a ocfs2: Change ocf... |
416 |
struct buffer_head *bh, |
13723d00e ocfs2: Use metada... |
417 |
ocfs2_journal_access_func access, |
8d6220d6a ocfs2: Change ocf... |
418 |
void *obj, |
9e62dc096 ocfs2: constify o... |
419 |
const struct ocfs2_extent_tree_operations *ops) |
e7d4cb6bc ocfs2: Abstract o... |
420 |
{ |
1a09f556e ocfs2: Create spe... |
421 |
et->et_ops = ops; |
ce1d9ea62 ocfs2: Prefix the... |
422 |
et->et_root_bh = bh; |
5e404e9ed ocfs2: Pass ocfs2... |
423 |
et->et_ci = ci; |
13723d00e ocfs2: Use metada... |
424 |
et->et_root_journal_access = access; |
ea5efa151 ocfs2: Make 'priv... |
425 426 427 |
if (!obj) obj = (void *)bh->b_data; et->et_object = obj; |
e7d4cb6bc ocfs2: Abstract o... |
428 |
|
0ce1010f1 ocfs2: Provide th... |
429 |
et->et_ops->eo_fill_root_el(et); |
943cced39 ocfs2: Determine ... |
430 431 432 |
if (!et->et_ops->eo_fill_max_leaf_clusters) et->et_max_leaf_clusters = 0; else |
6136ca5f5 ocfs2: Drop struc... |
433 |
et->et_ops->eo_fill_max_leaf_clusters(et); |
e7d4cb6bc ocfs2: Abstract o... |
434 |
} |
8d6220d6a ocfs2: Change ocf... |
435 |
void ocfs2_init_dinode_extent_tree(struct ocfs2_extent_tree *et, |
5e404e9ed ocfs2: Pass ocfs2... |
436 |
struct ocfs2_caching_info *ci, |
8d6220d6a ocfs2: Change ocf... |
437 |
struct buffer_head *bh) |
1a09f556e ocfs2: Create spe... |
438 |
{ |
5e404e9ed ocfs2: Pass ocfs2... |
439 |
__ocfs2_init_extent_tree(et, ci, bh, ocfs2_journal_access_di, |
13723d00e ocfs2: Use metada... |
440 |
NULL, &ocfs2_dinode_et_ops); |
1a09f556e ocfs2: Create spe... |
441 |
} |
8d6220d6a ocfs2: Change ocf... |
442 |
void ocfs2_init_xattr_tree_extent_tree(struct ocfs2_extent_tree *et, |
5e404e9ed ocfs2: Pass ocfs2... |
443 |
struct ocfs2_caching_info *ci, |
8d6220d6a ocfs2: Change ocf... |
444 |
struct buffer_head *bh) |
1a09f556e ocfs2: Create spe... |
445 |
{ |
5e404e9ed ocfs2: Pass ocfs2... |
446 |
__ocfs2_init_extent_tree(et, ci, bh, ocfs2_journal_access_xb, |
13723d00e ocfs2: Use metada... |
447 |
NULL, &ocfs2_xattr_tree_et_ops); |
1a09f556e ocfs2: Create spe... |
448 |
} |
8d6220d6a ocfs2: Change ocf... |
449 |
void ocfs2_init_xattr_value_extent_tree(struct ocfs2_extent_tree *et, |
5e404e9ed ocfs2: Pass ocfs2... |
450 |
struct ocfs2_caching_info *ci, |
2a50a743b ocfs2: Create ocf... |
451 |
struct ocfs2_xattr_value_buf *vb) |
e7d4cb6bc ocfs2: Abstract o... |
452 |
{ |
5e404e9ed ocfs2: Pass ocfs2... |
453 |
__ocfs2_init_extent_tree(et, ci, vb->vb_bh, vb->vb_access, vb, |
8d6220d6a ocfs2: Change ocf... |
454 |
&ocfs2_xattr_value_et_ops); |
e7d4cb6bc ocfs2: Abstract o... |
455 |
} |
9b7895efa ocfs2: Add a name... |
456 |
void ocfs2_init_dx_root_extent_tree(struct ocfs2_extent_tree *et, |
5e404e9ed ocfs2: Pass ocfs2... |
457 |
struct ocfs2_caching_info *ci, |
9b7895efa ocfs2: Add a name... |
458 459 |
struct buffer_head *bh) { |
5e404e9ed ocfs2: Pass ocfs2... |
460 |
__ocfs2_init_extent_tree(et, ci, bh, ocfs2_journal_access_dr, |
9b7895efa ocfs2: Add a name... |
461 462 |
NULL, &ocfs2_dx_root_et_ops); } |
fe9244159 ocfs2: Add refcou... |
463 464 465 466 467 468 469 |
void ocfs2_init_refcount_extent_tree(struct ocfs2_extent_tree *et, struct ocfs2_caching_info *ci, struct buffer_head *bh) { __ocfs2_init_extent_tree(et, ci, bh, ocfs2_journal_access_rb, NULL, &ocfs2_refcount_tree_et_ops); } |
35dc0aa3c ocfs2: Prefix the... |
470 471 |
static inline void ocfs2_et_set_last_eb_blk(struct ocfs2_extent_tree *et, u64 new_last_eb_blk) |
e7d4cb6bc ocfs2: Abstract o... |
472 |
{ |
ce1d9ea62 ocfs2: Prefix the... |
473 |
et->et_ops->eo_set_last_eb_blk(et, new_last_eb_blk); |
e7d4cb6bc ocfs2: Abstract o... |
474 |
} |
35dc0aa3c ocfs2: Prefix the... |
475 |
static inline u64 ocfs2_et_get_last_eb_blk(struct ocfs2_extent_tree *et) |
e7d4cb6bc ocfs2: Abstract o... |
476 |
{ |
ce1d9ea62 ocfs2: Prefix the... |
477 |
return et->et_ops->eo_get_last_eb_blk(et); |
e7d4cb6bc ocfs2: Abstract o... |
478 |
} |
6136ca5f5 ocfs2: Drop struc... |
479 |
static inline void ocfs2_et_update_clusters(struct ocfs2_extent_tree *et, |
35dc0aa3c ocfs2: Prefix the... |
480 481 |
u32 clusters) { |
6136ca5f5 ocfs2: Drop struc... |
482 |
et->et_ops->eo_update_clusters(et, clusters); |
35dc0aa3c ocfs2: Prefix the... |
483 |
} |
92ba470c4 ocfs2: Make exten... |
484 485 486 487 488 489 |
static inline void ocfs2_et_extent_map_insert(struct ocfs2_extent_tree *et, struct ocfs2_extent_rec *rec) { if (et->et_ops->eo_extent_map_insert) et->et_ops->eo_extent_map_insert(et, rec); } |
4c911eefc ocfs2: Make trunc... |
490 491 492 493 494 495 |
static inline void ocfs2_et_extent_map_truncate(struct ocfs2_extent_tree *et, u32 clusters) { if (et->et_ops->eo_extent_map_truncate) et->et_ops->eo_extent_map_truncate(et, clusters); } |
13723d00e ocfs2: Use metada... |
496 |
static inline int ocfs2_et_root_journal_access(handle_t *handle, |
13723d00e ocfs2: Use metada... |
497 498 499 |
struct ocfs2_extent_tree *et, int type) { |
d9a0a1f83 ocfs2: Store the ... |
500 |
return et->et_root_journal_access(handle, et->et_ci, et->et_root_bh, |
13723d00e ocfs2: Use metada... |
501 502 |
type); } |
853a3a143 ocfs2: Wrap ocfs2... |
503 504 505 506 507 508 509 510 511 512 513 514 |
static inline enum ocfs2_contig_type ocfs2_et_extent_contig(struct ocfs2_extent_tree *et, struct ocfs2_extent_rec *rec, struct ocfs2_extent_rec *insert_rec) { if (et->et_ops->eo_extent_contig) return et->et_ops->eo_extent_contig(et, rec, insert_rec); return ocfs2_extent_rec_contig( ocfs2_metadata_cache_get_super(et->et_ci), rec, insert_rec); } |
6136ca5f5 ocfs2: Drop struc... |
515 |
static inline int ocfs2_et_insert_check(struct ocfs2_extent_tree *et, |
1e61ee79e ocfs2: Add an ins... |
516 517 518 519 520 |
struct ocfs2_extent_rec *rec) { int ret = 0; if (et->et_ops->eo_insert_check) |
6136ca5f5 ocfs2: Drop struc... |
521 |
ret = et->et_ops->eo_insert_check(et, rec); |
1e61ee79e ocfs2: Add an ins... |
522 523 |
return ret; } |
6136ca5f5 ocfs2: Drop struc... |
524 |
static inline int ocfs2_et_sanity_check(struct ocfs2_extent_tree *et) |
e7d4cb6bc ocfs2: Abstract o... |
525 |
{ |
1e61ee79e ocfs2: Add an ins... |
526 527 528 |
int ret = 0; if (et->et_ops->eo_sanity_check) |
6136ca5f5 ocfs2: Drop struc... |
529 |
ret = et->et_ops->eo_sanity_check(et); |
1e61ee79e ocfs2: Add an ins... |
530 |
return ret; |
e7d4cb6bc ocfs2: Abstract o... |
531 |
} |
59a5e416d ocfs2: plug trunc... |
532 533 |
static int ocfs2_cache_extent_block_free(struct ocfs2_cached_dealloc_ctxt *ctxt, struct ocfs2_extent_block *eb); |
d401dc12f ocfs2: ocfs2_grow... |
534 535 |
static void ocfs2_adjust_rightmost_records(handle_t *handle, struct ocfs2_extent_tree *et, |
6b791bcc8 ocfs2: Adjust rig... |
536 537 |
struct ocfs2_path *path, struct ocfs2_extent_rec *insert_rec); |
dcd0538ff ocfs2: sparse b-t... |
538 539 540 541 542 |
/* * Reset the actual path elements so that we can re-use the structure * to build another path. Generally, this involves freeing the buffer * heads. */ |
e2e9f6082 ocfs2: move tree ... |
543 |
void ocfs2_reinit_path(struct ocfs2_path *path, int keep_root) |
dcd0538ff ocfs2: sparse b-t... |
544 545 546 |
{ int i, start = 0, depth = 0; struct ocfs2_path_item *node; |
ccd979bdb [PATCH] OCFS2: Th... |
547 |
|
dcd0538ff ocfs2: sparse b-t... |
548 549 |
if (keep_root) start = 1; |
ccd979bdb [PATCH] OCFS2: Th... |
550 |
|
dcd0538ff ocfs2: sparse b-t... |
551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 |
for(i = start; i < path_num_items(path); i++) { node = &path->p_node[i]; brelse(node->bh); node->bh = NULL; node->el = NULL; } /* * Tree depth may change during truncate, or insert. If we're * keeping the root extent list, then make sure that our path * structure reflects the proper depth. */ if (keep_root) depth = le16_to_cpu(path_root_el(path)->l_tree_depth); |
13723d00e ocfs2: Use metada... |
566 567 |
else path_root_access(path) = NULL; |
dcd0538ff ocfs2: sparse b-t... |
568 569 570 |
path->p_tree_depth = depth; } |
e2e9f6082 ocfs2: move tree ... |
571 |
void ocfs2_free_path(struct ocfs2_path *path) |
dcd0538ff ocfs2: sparse b-t... |
572 573 574 575 576 577 578 579 |
{ if (path) { ocfs2_reinit_path(path, 0); kfree(path); } } /* |
328d5752e ocfs2: btree chan... |
580 581 582 583 584 585 586 587 588 589 590 591 |
* All the elements of src into dest. After this call, src could be freed * without affecting dest. * * Both paths should have the same root. Any non-root elements of dest * will be freed. */ static void ocfs2_cp_path(struct ocfs2_path *dest, struct ocfs2_path *src) { int i; BUG_ON(path_root_bh(dest) != path_root_bh(src)); BUG_ON(path_root_el(dest) != path_root_el(src)); |
13723d00e ocfs2: Use metada... |
592 |
BUG_ON(path_root_access(dest) != path_root_access(src)); |
328d5752e ocfs2: btree chan... |
593 594 595 596 597 598 599 600 601 602 603 604 605 |
ocfs2_reinit_path(dest, 1); for(i = 1; i < OCFS2_MAX_PATH_DEPTH; i++) { dest->p_node[i].bh = src->p_node[i].bh; dest->p_node[i].el = src->p_node[i].el; if (dest->p_node[i].bh) get_bh(dest->p_node[i].bh); } } /* |
dcd0538ff ocfs2: sparse b-t... |
606 607 608 609 610 611 612 613 |
* Make the *dest path the same as src and re-initialize src path to * have a root only. */ static void ocfs2_mv_path(struct ocfs2_path *dest, struct ocfs2_path *src) { int i; BUG_ON(path_root_bh(dest) != path_root_bh(src)); |
13723d00e ocfs2: Use metada... |
614 |
BUG_ON(path_root_access(dest) != path_root_access(src)); |
dcd0538ff ocfs2: sparse b-t... |
615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 |
for(i = 1; i < OCFS2_MAX_PATH_DEPTH; i++) { brelse(dest->p_node[i].bh); dest->p_node[i].bh = src->p_node[i].bh; dest->p_node[i].el = src->p_node[i].el; src->p_node[i].bh = NULL; src->p_node[i].el = NULL; } } /* * Insert an extent block at given index. * * This will not take an additional reference on eb_bh. */ static inline void ocfs2_path_insert_eb(struct ocfs2_path *path, int index, struct buffer_head *eb_bh) { struct ocfs2_extent_block *eb = (struct ocfs2_extent_block *)eb_bh->b_data; /* * Right now, no root bh is an extent block, so this helps * catch code errors with dinode trees. The assertion can be * safely removed if we ever need to insert extent block * structures at the root. */ BUG_ON(index == 0); path->p_node[index].bh = eb_bh; path->p_node[index].el = &eb->h_list; } static struct ocfs2_path *ocfs2_new_path(struct buffer_head *root_bh, |
13723d00e ocfs2: Use metada... |
650 651 |
struct ocfs2_extent_list *root_el, ocfs2_journal_access_func access) |
dcd0538ff ocfs2: sparse b-t... |
652 653 |
{ struct ocfs2_path *path; |
ccd979bdb [PATCH] OCFS2: Th... |
654 |
|
dcd0538ff ocfs2: sparse b-t... |
655 656 657 658 659 660 661 662 |
BUG_ON(le16_to_cpu(root_el->l_tree_depth) >= OCFS2_MAX_PATH_DEPTH); path = kzalloc(sizeof(*path), GFP_NOFS); if (path) { path->p_tree_depth = le16_to_cpu(root_el->l_tree_depth); get_bh(root_bh); path_root_bh(path) = root_bh; path_root_el(path) = root_el; |
13723d00e ocfs2: Use metada... |
663 |
path_root_access(path) = access; |
dcd0538ff ocfs2: sparse b-t... |
664 665 666 667 |
} return path; } |
e2e9f6082 ocfs2: move tree ... |
668 |
struct ocfs2_path *ocfs2_new_path_from_path(struct ocfs2_path *path) |
ffdd7a546 ocfs2: Wrap up th... |
669 |
{ |
13723d00e ocfs2: Use metada... |
670 671 |
return ocfs2_new_path(path_root_bh(path), path_root_el(path), path_root_access(path)); |
ffdd7a546 ocfs2: Wrap up th... |
672 |
} |
e2e9f6082 ocfs2: move tree ... |
673 |
struct ocfs2_path *ocfs2_new_path_from_et(struct ocfs2_extent_tree *et) |
ffdd7a546 ocfs2: Wrap up th... |
674 |
{ |
13723d00e ocfs2: Use metada... |
675 676 677 678 679 680 681 682 683 684 685 |
return ocfs2_new_path(et->et_root_bh, et->et_root_el, et->et_root_journal_access); } /* * Journal the buffer at depth idx. All idx>0 are extent_blocks, * otherwise it's the root_access function. * * I don't like the way this function's name looks next to * ocfs2_journal_access_path(), but I don't have a better one. */ |
e2e9f6082 ocfs2: move tree ... |
686 687 688 689 |
int ocfs2_path_bh_journal_access(handle_t *handle, struct ocfs2_caching_info *ci, struct ocfs2_path *path, int idx) |
13723d00e ocfs2: Use metada... |
690 691 692 693 694 695 696 697 |
{ ocfs2_journal_access_func access = path_root_access(path); if (!access) access = ocfs2_journal_access; if (idx) access = ocfs2_journal_access_eb; |
0cf2f7632 ocfs2: Pass struc... |
698 |
return access(handle, ci, path->p_node[idx].bh, |
13723d00e ocfs2: Use metada... |
699 |
OCFS2_JOURNAL_ACCESS_WRITE); |
ffdd7a546 ocfs2: Wrap up th... |
700 |
} |
dcd0538ff ocfs2: sparse b-t... |
701 |
/* |
dcd0538ff ocfs2: sparse b-t... |
702 703 |
* Convenience function to journal all components in a path. */ |
e2e9f6082 ocfs2: move tree ... |
704 705 706 |
int ocfs2_journal_access_path(struct ocfs2_caching_info *ci, handle_t *handle, struct ocfs2_path *path) |
dcd0538ff ocfs2: sparse b-t... |
707 708 709 710 711 712 713 |
{ int i, ret = 0; if (!path) goto out; for(i = 0; i < path_num_items(path); i++) { |
0cf2f7632 ocfs2: Pass struc... |
714 |
ret = ocfs2_path_bh_journal_access(handle, ci, path, i); |
dcd0538ff ocfs2: sparse b-t... |
715 716 717 718 719 720 721 722 723 |
if (ret < 0) { mlog_errno(ret); goto out; } } out: return ret; } |
328d5752e ocfs2: btree chan... |
724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 |
/* * Return the index of the extent record which contains cluster #v_cluster. * -1 is returned if it was not found. * * Should work fine on interior and exterior nodes. */ int ocfs2_search_extent_list(struct ocfs2_extent_list *el, u32 v_cluster) { int ret = -1; int i; struct ocfs2_extent_rec *rec; u32 rec_end, rec_start, clusters; for(i = 0; i < le16_to_cpu(el->l_next_free_rec); i++) { rec = &el->l_recs[i]; rec_start = le32_to_cpu(rec->e_cpos); clusters = ocfs2_rec_clusters(el, rec); rec_end = rec_start + clusters; if (v_cluster >= rec_start && v_cluster < rec_end) { ret = i; break; } } return ret; } |
e48edee2d ocfs2: make room ... |
753 754 |
/* * NOTE: ocfs2_block_extent_contig(), ocfs2_extents_adjacent() and |
853a3a143 ocfs2: Wrap ocfs2... |
755 |
* ocfs2_extent_rec_contig only work properly against leaf nodes! |
e48edee2d ocfs2: make room ... |
756 |
*/ |
dcd0538ff ocfs2: sparse b-t... |
757 758 759 |
static int ocfs2_block_extent_contig(struct super_block *sb, struct ocfs2_extent_rec *ext, u64 blkno) |
ccd979bdb [PATCH] OCFS2: Th... |
760 |
{ |
e48edee2d ocfs2: make room ... |
761 762 763 764 765 766 |
u64 blk_end = le64_to_cpu(ext->e_blkno); blk_end += ocfs2_clusters_to_blocks(sb, le16_to_cpu(ext->e_leaf_clusters)); return blkno == blk_end; |
ccd979bdb [PATCH] OCFS2: Th... |
767 |
} |
dcd0538ff ocfs2: sparse b-t... |
768 769 770 |
static int ocfs2_extents_adjacent(struct ocfs2_extent_rec *left, struct ocfs2_extent_rec *right) { |
e48edee2d ocfs2: make room ... |
771 772 773 774 775 776 |
u32 left_range; left_range = le32_to_cpu(left->e_cpos) + le16_to_cpu(left->e_leaf_clusters); return (left_range == le32_to_cpu(right->e_cpos)); |
dcd0538ff ocfs2: sparse b-t... |
777 778 779 |
} static enum ocfs2_contig_type |
853a3a143 ocfs2: Wrap ocfs2... |
780 781 782 |
ocfs2_extent_rec_contig(struct super_block *sb, struct ocfs2_extent_rec *ext, struct ocfs2_extent_rec *insert_rec) |
dcd0538ff ocfs2: sparse b-t... |
783 784 |
{ u64 blkno = le64_to_cpu(insert_rec->e_blkno); |
328d5752e ocfs2: btree chan... |
785 786 787 788 789 790 791 |
/* * Refuse to coalesce extent records with different flag * fields - we don't want to mix unwritten extents with user * data. */ if (ext->e_flags != insert_rec->e_flags) return CONTIG_NONE; |
dcd0538ff ocfs2: sparse b-t... |
792 |
if (ocfs2_extents_adjacent(ext, insert_rec) && |
b4a176515 ocfs2: ocfs2_exte... |
793 |
ocfs2_block_extent_contig(sb, ext, blkno)) |
dcd0538ff ocfs2: sparse b-t... |
794 795 796 797 |
return CONTIG_RIGHT; blkno = le64_to_cpu(ext->e_blkno); if (ocfs2_extents_adjacent(insert_rec, ext) && |
b4a176515 ocfs2: ocfs2_exte... |
798 |
ocfs2_block_extent_contig(sb, insert_rec, blkno)) |
dcd0538ff ocfs2: sparse b-t... |
799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 |
return CONTIG_LEFT; return CONTIG_NONE; } /* * NOTE: We can have pretty much any combination of contiguousness and * appending. * * The usefulness of APPEND_TAIL is more in that it lets us know that * we'll have to update the path to that leaf. */ enum ocfs2_append_type { APPEND_NONE = 0, APPEND_TAIL, }; |
328d5752e ocfs2: btree chan... |
815 816 817 818 819 |
enum ocfs2_split_type { SPLIT_NONE = 0, SPLIT_LEFT, SPLIT_RIGHT, }; |
dcd0538ff ocfs2: sparse b-t... |
820 |
struct ocfs2_insert_type { |
328d5752e ocfs2: btree chan... |
821 |
enum ocfs2_split_type ins_split; |
dcd0538ff ocfs2: sparse b-t... |
822 823 824 |
enum ocfs2_append_type ins_appending; enum ocfs2_contig_type ins_contig; int ins_contig_index; |
dcd0538ff ocfs2: sparse b-t... |
825 826 |
int ins_tree_depth; }; |
328d5752e ocfs2: btree chan... |
827 828 829 830 |
struct ocfs2_merge_ctxt { enum ocfs2_contig_type c_contig_type; int c_has_empty_extent; int c_split_covers_rec; |
328d5752e ocfs2: btree chan... |
831 |
}; |
5e96581a3 ocfs2: Wrap exten... |
832 833 834 |
static int ocfs2_validate_extent_block(struct super_block *sb, struct buffer_head *bh) { |
d6b32bbb3 ocfs2: block read... |
835 |
int rc; |
5e96581a3 ocfs2: Wrap exten... |
836 837 |
struct ocfs2_extent_block *eb = (struct ocfs2_extent_block *)bh->b_data; |
a09d09b8f ocfs2: Remove mlo... |
838 |
trace_ocfs2_validate_extent_block((unsigned long long)bh->b_blocknr); |
970e4936d ocfs2: Validate m... |
839 |
|
d6b32bbb3 ocfs2: block read... |
840 841 842 843 844 845 846 847 |
BUG_ON(!buffer_uptodate(bh)); /* * If the ecc fails, we return the error but otherwise * leave the filesystem running. We know any error is * local to this block. */ rc = ocfs2_validate_meta_ecc(sb, bh->b_data, &eb->h_check); |
13723d00e ocfs2: Use metada... |
848 849 850 851 |
if (rc) { mlog(ML_ERROR, "Checksum failed for extent block %llu ", (unsigned long long)bh->b_blocknr); |
d6b32bbb3 ocfs2: block read... |
852 |
return rc; |
13723d00e ocfs2: Use metada... |
853 |
} |
d6b32bbb3 ocfs2: block read... |
854 855 856 857 |
/* * Errors after here are fatal. */ |
5e96581a3 ocfs2: Wrap exten... |
858 |
if (!OCFS2_IS_VALID_EXTENT_BLOCK(eb)) { |
17a5b9ab3 ocfs2: acknowledg... |
859 |
rc = ocfs2_error(sb, |
7ecef14ab ocfs2: neaten do_... |
860 861 862 863 |
"Extent block #%llu has bad signature %.*s ", (unsigned long long)bh->b_blocknr, 7, eb->h_signature); |
17a5b9ab3 ocfs2: acknowledg... |
864 |
goto bail; |
5e96581a3 ocfs2: Wrap exten... |
865 866 867 |
} if (le64_to_cpu(eb->h_blkno) != bh->b_blocknr) { |
17a5b9ab3 ocfs2: acknowledg... |
868 |
rc = ocfs2_error(sb, |
7ecef14ab ocfs2: neaten do_... |
869 870 871 872 |
"Extent block #%llu has an invalid h_blkno of %llu ", (unsigned long long)bh->b_blocknr, (unsigned long long)le64_to_cpu(eb->h_blkno)); |
17a5b9ab3 ocfs2: acknowledg... |
873 |
goto bail; |
5e96581a3 ocfs2: Wrap exten... |
874 875 876 |
} if (le32_to_cpu(eb->h_fs_generation) != OCFS2_SB(sb)->fs_generation) { |
17a5b9ab3 ocfs2: acknowledg... |
877 |
rc = ocfs2_error(sb, |
7ecef14ab ocfs2: neaten do_... |
878 879 880 881 |
"Extent block #%llu has an invalid h_fs_generation of #%u ", (unsigned long long)bh->b_blocknr, le32_to_cpu(eb->h_fs_generation)); |
17a5b9ab3 ocfs2: acknowledg... |
882 |
goto bail; |
5e96581a3 ocfs2: Wrap exten... |
883 |
} |
17a5b9ab3 ocfs2: acknowledg... |
884 885 |
bail: return rc; |
5e96581a3 ocfs2: Wrap exten... |
886 |
} |
3d03a305d ocfs2: Pass ocfs2... |
887 |
int ocfs2_read_extent_block(struct ocfs2_caching_info *ci, u64 eb_blkno, |
5e96581a3 ocfs2: Wrap exten... |
888 889 890 891 |
struct buffer_head **bh) { int rc; struct buffer_head *tmp = *bh; |
3d03a305d ocfs2: Pass ocfs2... |
892 |
rc = ocfs2_read_block(ci, eb_blkno, &tmp, |
970e4936d ocfs2: Validate m... |
893 |
ocfs2_validate_extent_block); |
5e96581a3 ocfs2: Wrap exten... |
894 895 |
/* If ocfs2_read_block() got us a new bh, pass it up. */ |
970e4936d ocfs2: Validate m... |
896 |
if (!rc && !*bh) |
5e96581a3 ocfs2: Wrap exten... |
897 |
*bh = tmp; |
5e96581a3 ocfs2: Wrap exten... |
898 899 |
return rc; } |
ccd979bdb [PATCH] OCFS2: Th... |
900 901 902 |
/* * How many free extents have we got before we need more meta data? */ |
964f14a0d ocfs2: clean up s... |
903 |
int ocfs2_num_free_extents(struct ocfs2_extent_tree *et) |
ccd979bdb [PATCH] OCFS2: Th... |
904 905 |
{ int retval; |
e7d4cb6bc ocfs2: Abstract o... |
906 |
struct ocfs2_extent_list *el = NULL; |
ccd979bdb [PATCH] OCFS2: Th... |
907 908 |
struct ocfs2_extent_block *eb; struct buffer_head *eb_bh = NULL; |
e7d4cb6bc ocfs2: Abstract o... |
909 |
u64 last_eb_blk = 0; |
ccd979bdb [PATCH] OCFS2: Th... |
910 |
|
f99b9b7cc ocfs2: Make ocfs2... |
911 912 |
el = et->et_root_el; last_eb_blk = ocfs2_et_get_last_eb_blk(et); |
ccd979bdb [PATCH] OCFS2: Th... |
913 |
|
e7d4cb6bc ocfs2: Abstract o... |
914 |
if (last_eb_blk) { |
3d03a305d ocfs2: Pass ocfs2... |
915 916 |
retval = ocfs2_read_extent_block(et->et_ci, last_eb_blk, &eb_bh); |
ccd979bdb [PATCH] OCFS2: Th... |
917 918 919 920 921 922 |
if (retval < 0) { mlog_errno(retval); goto bail; } eb = (struct ocfs2_extent_block *) eb_bh->b_data; el = &eb->h_list; |
e7d4cb6bc ocfs2: Abstract o... |
923 |
} |
ccd979bdb [PATCH] OCFS2: Th... |
924 925 926 927 928 |
BUG_ON(el->l_tree_depth != 0); retval = le16_to_cpu(el->l_count) - le16_to_cpu(el->l_next_free_rec); bail: |
a81cb88b6 ocfs2: Don't chec... |
929 |
brelse(eb_bh); |
ccd979bdb [PATCH] OCFS2: Th... |
930 |
|
a09d09b8f ocfs2: Remove mlo... |
931 |
trace_ocfs2_num_free_extents(retval); |
ccd979bdb [PATCH] OCFS2: Th... |
932 933 934 935 936 937 938 939 |
return retval; } /* expects array to already be allocated * * sets h_signature, h_blkno, h_suballoc_bit, h_suballoc_slot, and * l_count for you */ |
42a5a7a9a ocfs2: ocfs2_crea... |
940 941 |
static int ocfs2_create_new_meta_bhs(handle_t *handle, struct ocfs2_extent_tree *et, |
ccd979bdb [PATCH] OCFS2: Th... |
942 943 944 945 946 947 948 |
int wanted, struct ocfs2_alloc_context *meta_ac, struct buffer_head *bhs[]) { int count, status, i; u16 suballoc_bit_start; u32 num_got; |
2b6cb576a ocfs2: Set suball... |
949 |
u64 suballoc_loc, first_blkno; |
42a5a7a9a ocfs2: ocfs2_crea... |
950 951 |
struct ocfs2_super *osb = OCFS2_SB(ocfs2_metadata_cache_get_super(et->et_ci)); |
ccd979bdb [PATCH] OCFS2: Th... |
952 |
struct ocfs2_extent_block *eb; |
ccd979bdb [PATCH] OCFS2: Th... |
953 954 |
count = 0; while (count < wanted) { |
1ed9b777f ocfs2: ocfs2_clai... |
955 |
status = ocfs2_claim_metadata(handle, |
ccd979bdb [PATCH] OCFS2: Th... |
956 957 |
meta_ac, wanted - count, |
2b6cb576a ocfs2: Set suball... |
958 |
&suballoc_loc, |
ccd979bdb [PATCH] OCFS2: Th... |
959 960 961 962 963 964 965 966 967 968 969 |
&suballoc_bit_start, &num_got, &first_blkno); if (status < 0) { mlog_errno(status); goto bail; } for(i = count; i < (num_got + count); i++) { bhs[i] = sb_getblk(osb->sb, first_blkno); if (bhs[i] == NULL) { |
7391a294b ocfs2: return ENO... |
970 |
status = -ENOMEM; |
ccd979bdb [PATCH] OCFS2: Th... |
971 972 973 |
mlog_errno(status); goto bail; } |
42a5a7a9a ocfs2: ocfs2_crea... |
974 |
ocfs2_set_new_buffer_uptodate(et->et_ci, bhs[i]); |
ccd979bdb [PATCH] OCFS2: Th... |
975 |
|
42a5a7a9a ocfs2: ocfs2_crea... |
976 977 |
status = ocfs2_journal_access_eb(handle, et->et_ci, bhs[i], |
13723d00e ocfs2: Use metada... |
978 |
OCFS2_JOURNAL_ACCESS_CREATE); |
ccd979bdb [PATCH] OCFS2: Th... |
979 980 981 982 983 984 985 986 987 988 989 |
if (status < 0) { mlog_errno(status); goto bail; } memset(bhs[i]->b_data, 0, osb->sb->s_blocksize); eb = (struct ocfs2_extent_block *) bhs[i]->b_data; /* Ok, setup the minimal stuff here. */ strcpy(eb->h_signature, OCFS2_EXTENT_BLOCK_SIGNATURE); eb->h_blkno = cpu_to_le64(first_blkno); eb->h_fs_generation = cpu_to_le32(osb->fs_generation); |
b89c54282 ocfs2: add extent... |
990 991 |
eb->h_suballoc_slot = cpu_to_le16(meta_ac->ac_alloc_slot); |
2b6cb576a ocfs2: Set suball... |
992 |
eb->h_suballoc_loc = cpu_to_le64(suballoc_loc); |
ccd979bdb [PATCH] OCFS2: Th... |
993 994 995 996 997 998 999 1000 1001 |
eb->h_suballoc_bit = cpu_to_le16(suballoc_bit_start); eb->h_list.l_count = cpu_to_le16(ocfs2_extent_recs_per_eb(osb->sb)); suballoc_bit_start++; first_blkno++; /* We'll also be dirtied by the caller, so * this isn't absolutely necessary. */ |
ec20cec7a ocfs2: Make ocfs2... |
1002 |
ocfs2_journal_dirty(handle, bhs[i]); |
ccd979bdb [PATCH] OCFS2: Th... |
1003 1004 1005 1006 1007 1008 1009 1010 1011 |
} count += num_got; } status = 0; bail: if (status < 0) { for(i = 0; i < wanted; i++) { |
a81cb88b6 ocfs2: Don't chec... |
1012 |
brelse(bhs[i]); |
ccd979bdb [PATCH] OCFS2: Th... |
1013 1014 |
bhs[i] = NULL; } |
c1e8d35ef ocfs2: Remove EXI... |
1015 |
mlog_errno(status); |
ccd979bdb [PATCH] OCFS2: Th... |
1016 |
} |
ccd979bdb [PATCH] OCFS2: Th... |
1017 1018 1019 1020 |
return status; } /* |
dcd0538ff ocfs2: sparse b-t... |
1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 |
* Helper function for ocfs2_add_branch() and ocfs2_shift_tree_depth(). * * Returns the sum of the rightmost extent rec logical offset and * cluster count. * * ocfs2_add_branch() uses this to determine what logical cluster * value should be populated into the leftmost new branch records. * * ocfs2_shift_tree_depth() uses this to determine the # clusters * value for the new topmost tree record. */ static inline u32 ocfs2_sum_rightmost_rec(struct ocfs2_extent_list *el) { int i; i = le16_to_cpu(el->l_next_free_rec) - 1; return le32_to_cpu(el->l_recs[i].e_cpos) + |
e48edee2d ocfs2: make room ... |
1039 |
ocfs2_rec_clusters(el, &el->l_recs[i]); |
dcd0538ff ocfs2: sparse b-t... |
1040 1041 1042 |
} /* |
6b791bcc8 ocfs2: Adjust rig... |
1043 1044 1045 1046 |
* Change range of the branches in the right most path according to the leaf * extent block's rightmost record. */ static int ocfs2_adjust_rightmost_branch(handle_t *handle, |
6b791bcc8 ocfs2: Adjust rig... |
1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 |
struct ocfs2_extent_tree *et) { int status; struct ocfs2_path *path = NULL; struct ocfs2_extent_list *el; struct ocfs2_extent_rec *rec; path = ocfs2_new_path_from_et(et); if (!path) { status = -ENOMEM; return status; } |
facdb77f5 ocfs2: ocfs2_find... |
1059 |
status = ocfs2_find_path(et->et_ci, path, UINT_MAX); |
6b791bcc8 ocfs2: Adjust rig... |
1060 1061 1062 1063 |
if (status < 0) { mlog_errno(status); goto out; } |
c901fb007 ocfs2: Make ocfs2... |
1064 |
status = ocfs2_extend_trans(handle, path_num_items(path)); |
6b791bcc8 ocfs2: Adjust rig... |
1065 1066 1067 1068 |
if (status < 0) { mlog_errno(status); goto out; } |
d401dc12f ocfs2: ocfs2_grow... |
1069 |
status = ocfs2_journal_access_path(et->et_ci, handle, path); |
6b791bcc8 ocfs2: Adjust rig... |
1070 1071 1072 1073 1074 1075 |
if (status < 0) { mlog_errno(status); goto out; } el = path_leaf_el(path); |
3a251f04f ocfs2: ->l_next_f... |
1076 |
rec = &el->l_recs[le16_to_cpu(el->l_next_free_rec) - 1]; |
6b791bcc8 ocfs2: Adjust rig... |
1077 |
|
d401dc12f ocfs2: ocfs2_grow... |
1078 |
ocfs2_adjust_rightmost_records(handle, et, path, rec); |
6b791bcc8 ocfs2: Adjust rig... |
1079 1080 1081 1082 1083 1084 1085 |
out: ocfs2_free_path(path); return status; } /* |
ccd979bdb [PATCH] OCFS2: Th... |
1086 |
* Add an entire tree branch to our inode. eb_bh is the extent block |
d401dc12f ocfs2: ocfs2_grow... |
1087 |
* to start at, if we don't want to start the branch at the root |
ccd979bdb [PATCH] OCFS2: Th... |
1088 1089 1090 1091 1092 1093 |
* structure. * * last_eb_bh is required as we have to update it's next_leaf pointer * for the new last extent block. * * the new branch will be 'empty' in the sense that every block will |
e48edee2d ocfs2: make room ... |
1094 |
* contain a single record with cluster count == 0. |
ccd979bdb [PATCH] OCFS2: Th... |
1095 |
*/ |
d401dc12f ocfs2: ocfs2_grow... |
1096 |
static int ocfs2_add_branch(handle_t *handle, |
e7d4cb6bc ocfs2: Abstract o... |
1097 |
struct ocfs2_extent_tree *et, |
ccd979bdb [PATCH] OCFS2: Th... |
1098 |
struct buffer_head *eb_bh, |
328d5752e ocfs2: btree chan... |
1099 |
struct buffer_head **last_eb_bh, |
ccd979bdb [PATCH] OCFS2: Th... |
1100 1101 1102 1103 1104 1105 |
struct ocfs2_alloc_context *meta_ac) { int status, new_blocks, i; u64 next_blkno, new_last_eb_blk; struct buffer_head *bh; struct buffer_head **new_eb_bhs = NULL; |
ccd979bdb [PATCH] OCFS2: Th... |
1106 1107 1108 |
struct ocfs2_extent_block *eb; struct ocfs2_extent_list *eb_el; struct ocfs2_extent_list *el; |
6b791bcc8 ocfs2: Adjust rig... |
1109 |
u32 new_cpos, root_end; |
ccd979bdb [PATCH] OCFS2: Th... |
1110 |
|
328d5752e ocfs2: btree chan... |
1111 |
BUG_ON(!last_eb_bh || !*last_eb_bh); |
ccd979bdb [PATCH] OCFS2: Th... |
1112 |
|
ccd979bdb [PATCH] OCFS2: Th... |
1113 1114 1115 1116 |
if (eb_bh) { eb = (struct ocfs2_extent_block *) eb_bh->b_data; el = &eb->h_list; } else |
ce1d9ea62 ocfs2: Prefix the... |
1117 |
el = et->et_root_el; |
ccd979bdb [PATCH] OCFS2: Th... |
1118 1119 1120 1121 1122 |
/* we never add a branch to a leaf. */ BUG_ON(!el->l_tree_depth); new_blocks = le16_to_cpu(el->l_tree_depth); |
6b791bcc8 ocfs2: Adjust rig... |
1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 |
eb = (struct ocfs2_extent_block *)(*last_eb_bh)->b_data; new_cpos = ocfs2_sum_rightmost_rec(&eb->h_list); root_end = ocfs2_sum_rightmost_rec(et->et_root_el); /* * If there is a gap before the root end and the real end * of the righmost leaf block, we need to remove the gap * between new_cpos and root_end first so that the tree * is consistent after we add a new branch(it will start * from new_cpos). */ if (root_end > new_cpos) { |
a09d09b8f ocfs2: Remove mlo... |
1135 1136 1137 1138 |
trace_ocfs2_adjust_rightmost_branch( (unsigned long long) ocfs2_metadata_cache_owner(et->et_ci), root_end, new_cpos); |
d401dc12f ocfs2: ocfs2_grow... |
1139 |
status = ocfs2_adjust_rightmost_branch(handle, et); |
6b791bcc8 ocfs2: Adjust rig... |
1140 1141 1142 1143 1144 |
if (status) { mlog_errno(status); goto bail; } } |
ccd979bdb [PATCH] OCFS2: Th... |
1145 1146 1147 1148 1149 1150 1151 1152 |
/* allocate the number of new eb blocks we need */ new_eb_bhs = kcalloc(new_blocks, sizeof(struct buffer_head *), GFP_KERNEL); if (!new_eb_bhs) { status = -ENOMEM; mlog_errno(status); goto bail; } |
42a5a7a9a ocfs2: ocfs2_crea... |
1153 |
status = ocfs2_create_new_meta_bhs(handle, et, new_blocks, |
ccd979bdb [PATCH] OCFS2: Th... |
1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 |
meta_ac, new_eb_bhs); if (status < 0) { mlog_errno(status); goto bail; } /* Note: new_eb_bhs[new_blocks - 1] is the guy which will be * linked with the rest of the tree. * conversly, new_eb_bhs[0] is the new bottommost leaf. * * when we leave the loop, new_last_eb_blk will point to the * newest leaf, and next_blkno will point to the topmost extent * block. */ next_blkno = new_last_eb_blk = 0; for(i = 0; i < new_blocks; i++) { bh = new_eb_bhs[i]; eb = (struct ocfs2_extent_block *) bh->b_data; |
5e96581a3 ocfs2: Wrap exten... |
1171 1172 |
/* ocfs2_create_new_meta_bhs() should create it right! */ BUG_ON(!OCFS2_IS_VALID_EXTENT_BLOCK(eb)); |
ccd979bdb [PATCH] OCFS2: Th... |
1173 |
eb_el = &eb->h_list; |
d401dc12f ocfs2: ocfs2_grow... |
1174 |
status = ocfs2_journal_access_eb(handle, et->et_ci, bh, |
13723d00e ocfs2: Use metada... |
1175 |
OCFS2_JOURNAL_ACCESS_CREATE); |
ccd979bdb [PATCH] OCFS2: Th... |
1176 1177 1178 1179 1180 1181 1182 1183 |
if (status < 0) { mlog_errno(status); goto bail; } eb->h_next_leaf_blk = 0; eb_el->l_tree_depth = cpu_to_le16(i); eb_el->l_next_free_rec = cpu_to_le16(1); |
dcd0538ff ocfs2: sparse b-t... |
1184 1185 1186 1187 1188 |
/* * This actually counts as an empty extent as * c_clusters == 0 */ eb_el->l_recs[0].e_cpos = cpu_to_le32(new_cpos); |
ccd979bdb [PATCH] OCFS2: Th... |
1189 |
eb_el->l_recs[0].e_blkno = cpu_to_le64(next_blkno); |
e48edee2d ocfs2: make room ... |
1190 1191 1192 1193 1194 1195 |
/* * eb_el isn't always an interior node, but even leaf * nodes want a zero'd flags and reserved field so * this gets the whole 32 bits regardless of use. */ eb_el->l_recs[0].e_int_clusters = cpu_to_le32(0); |
ccd979bdb [PATCH] OCFS2: Th... |
1196 1197 |
if (!eb_el->l_tree_depth) new_last_eb_blk = le64_to_cpu(eb->h_blkno); |
ec20cec7a ocfs2: Make ocfs2... |
1198 |
ocfs2_journal_dirty(handle, bh); |
ccd979bdb [PATCH] OCFS2: Th... |
1199 1200 1201 1202 1203 1204 1205 1206 1207 |
next_blkno = le64_to_cpu(eb->h_blkno); } /* This is a bit hairy. We want to update up to three blocks * here without leaving any of them in an inconsistent state * in case of error. We don't have to worry about * journal_dirty erroring as it won't unless we've aborted the * handle (in which case we would never be here) so reserving * the write with journal_access is all we need to do. */ |
d401dc12f ocfs2: ocfs2_grow... |
1208 |
status = ocfs2_journal_access_eb(handle, et->et_ci, *last_eb_bh, |
13723d00e ocfs2: Use metada... |
1209 |
OCFS2_JOURNAL_ACCESS_WRITE); |
ccd979bdb [PATCH] OCFS2: Th... |
1210 1211 1212 1213 |
if (status < 0) { mlog_errno(status); goto bail; } |
d9a0a1f83 ocfs2: Store the ... |
1214 |
status = ocfs2_et_root_journal_access(handle, et, |
13723d00e ocfs2: Use metada... |
1215 |
OCFS2_JOURNAL_ACCESS_WRITE); |
ccd979bdb [PATCH] OCFS2: Th... |
1216 1217 1218 1219 1220 |
if (status < 0) { mlog_errno(status); goto bail; } if (eb_bh) { |
d401dc12f ocfs2: ocfs2_grow... |
1221 |
status = ocfs2_journal_access_eb(handle, et->et_ci, eb_bh, |
13723d00e ocfs2: Use metada... |
1222 |
OCFS2_JOURNAL_ACCESS_WRITE); |
ccd979bdb [PATCH] OCFS2: Th... |
1223 1224 1225 1226 1227 1228 1229 |
if (status < 0) { mlog_errno(status); goto bail; } } /* Link the new branch into the rest of the tree (el will |
e7d4cb6bc ocfs2: Abstract o... |
1230 |
* either be on the root_bh, or the extent block passed in. */ |
ccd979bdb [PATCH] OCFS2: Th... |
1231 1232 |
i = le16_to_cpu(el->l_next_free_rec); el->l_recs[i].e_blkno = cpu_to_le64(next_blkno); |
dcd0538ff ocfs2: sparse b-t... |
1233 |
el->l_recs[i].e_cpos = cpu_to_le32(new_cpos); |
e48edee2d ocfs2: make room ... |
1234 |
el->l_recs[i].e_int_clusters = 0; |
ccd979bdb [PATCH] OCFS2: Th... |
1235 1236 1237 1238 |
le16_add_cpu(&el->l_next_free_rec, 1); /* fe needs a new last extent block pointer, as does the * next_leaf on the previously last-extent-block. */ |
35dc0aa3c ocfs2: Prefix the... |
1239 |
ocfs2_et_set_last_eb_blk(et, new_last_eb_blk); |
ccd979bdb [PATCH] OCFS2: Th... |
1240 |
|
328d5752e ocfs2: btree chan... |
1241 |
eb = (struct ocfs2_extent_block *) (*last_eb_bh)->b_data; |
ccd979bdb [PATCH] OCFS2: Th... |
1242 |
eb->h_next_leaf_blk = cpu_to_le64(new_last_eb_blk); |
ec20cec7a ocfs2: Make ocfs2... |
1243 1244 1245 1246 |
ocfs2_journal_dirty(handle, *last_eb_bh); ocfs2_journal_dirty(handle, et->et_root_bh); if (eb_bh) ocfs2_journal_dirty(handle, eb_bh); |
ccd979bdb [PATCH] OCFS2: Th... |
1247 |
|
328d5752e ocfs2: btree chan... |
1248 1249 1250 1251 1252 1253 1254 |
/* * Some callers want to track the rightmost leaf so pass it * back here. */ brelse(*last_eb_bh); get_bh(new_eb_bhs[0]); *last_eb_bh = new_eb_bhs[0]; |
ccd979bdb [PATCH] OCFS2: Th... |
1255 1256 1257 1258 |
status = 0; bail: if (new_eb_bhs) { for (i = 0; i < new_blocks; i++) |
a81cb88b6 ocfs2: Don't chec... |
1259 |
brelse(new_eb_bhs[i]); |
ccd979bdb [PATCH] OCFS2: Th... |
1260 1261 |
kfree(new_eb_bhs); } |
ccd979bdb [PATCH] OCFS2: Th... |
1262 1263 1264 1265 1266 1267 1268 1269 |
return status; } /* * adds another level to the allocation tree. * returns back the new extent block so you can add a branch to it * after this call. */ |
d401dc12f ocfs2: ocfs2_grow... |
1270 |
static int ocfs2_shift_tree_depth(handle_t *handle, |
e7d4cb6bc ocfs2: Abstract o... |
1271 |
struct ocfs2_extent_tree *et, |
ccd979bdb [PATCH] OCFS2: Th... |
1272 1273 1274 1275 |
struct ocfs2_alloc_context *meta_ac, struct buffer_head **ret_new_eb_bh) { int status, i; |
dcd0538ff ocfs2: sparse b-t... |
1276 |
u32 new_clusters; |
ccd979bdb [PATCH] OCFS2: Th... |
1277 |
struct buffer_head *new_eb_bh = NULL; |
ccd979bdb [PATCH] OCFS2: Th... |
1278 |
struct ocfs2_extent_block *eb; |
e7d4cb6bc ocfs2: Abstract o... |
1279 |
struct ocfs2_extent_list *root_el; |
ccd979bdb [PATCH] OCFS2: Th... |
1280 |
struct ocfs2_extent_list *eb_el; |
42a5a7a9a ocfs2: ocfs2_crea... |
1281 |
status = ocfs2_create_new_meta_bhs(handle, et, 1, meta_ac, |
ccd979bdb [PATCH] OCFS2: Th... |
1282 1283 1284 1285 1286 1287 1288 |
&new_eb_bh); if (status < 0) { mlog_errno(status); goto bail; } eb = (struct ocfs2_extent_block *) new_eb_bh->b_data; |
5e96581a3 ocfs2: Wrap exten... |
1289 1290 |
/* ocfs2_create_new_meta_bhs() should create it right! */ BUG_ON(!OCFS2_IS_VALID_EXTENT_BLOCK(eb)); |
ccd979bdb [PATCH] OCFS2: Th... |
1291 1292 |
eb_el = &eb->h_list; |
ce1d9ea62 ocfs2: Prefix the... |
1293 |
root_el = et->et_root_el; |
ccd979bdb [PATCH] OCFS2: Th... |
1294 |
|
d401dc12f ocfs2: ocfs2_grow... |
1295 |
status = ocfs2_journal_access_eb(handle, et->et_ci, new_eb_bh, |
13723d00e ocfs2: Use metada... |
1296 |
OCFS2_JOURNAL_ACCESS_CREATE); |
ccd979bdb [PATCH] OCFS2: Th... |
1297 1298 1299 1300 |
if (status < 0) { mlog_errno(status); goto bail; } |
e7d4cb6bc ocfs2: Abstract o... |
1301 1302 1303 1304 1305 |
/* copy the root extent list data into the new extent block */ eb_el->l_tree_depth = root_el->l_tree_depth; eb_el->l_next_free_rec = root_el->l_next_free_rec; for (i = 0; i < le16_to_cpu(root_el->l_next_free_rec); i++) eb_el->l_recs[i] = root_el->l_recs[i]; |
ccd979bdb [PATCH] OCFS2: Th... |
1306 |
|
ec20cec7a ocfs2: Make ocfs2... |
1307 |
ocfs2_journal_dirty(handle, new_eb_bh); |
ccd979bdb [PATCH] OCFS2: Th... |
1308 |
|
d9a0a1f83 ocfs2: Store the ... |
1309 |
status = ocfs2_et_root_journal_access(handle, et, |
13723d00e ocfs2: Use metada... |
1310 |
OCFS2_JOURNAL_ACCESS_WRITE); |
ccd979bdb [PATCH] OCFS2: Th... |
1311 1312 1313 1314 |
if (status < 0) { mlog_errno(status); goto bail; } |
dcd0538ff ocfs2: sparse b-t... |
1315 |
new_clusters = ocfs2_sum_rightmost_rec(eb_el); |
e7d4cb6bc ocfs2: Abstract o... |
1316 1317 1318 1319 1320 1321 1322 1323 |
/* update root_bh now */ le16_add_cpu(&root_el->l_tree_depth, 1); root_el->l_recs[0].e_cpos = 0; root_el->l_recs[0].e_blkno = eb->h_blkno; root_el->l_recs[0].e_int_clusters = cpu_to_le32(new_clusters); for (i = 1; i < le16_to_cpu(root_el->l_next_free_rec); i++) memset(&root_el->l_recs[i], 0, sizeof(struct ocfs2_extent_rec)); root_el->l_next_free_rec = cpu_to_le16(1); |
ccd979bdb [PATCH] OCFS2: Th... |
1324 1325 1326 |
/* If this is our 1st tree depth shift, then last_eb_blk * becomes the allocated extent block */ |
e7d4cb6bc ocfs2: Abstract o... |
1327 |
if (root_el->l_tree_depth == cpu_to_le16(1)) |
35dc0aa3c ocfs2: Prefix the... |
1328 |
ocfs2_et_set_last_eb_blk(et, le64_to_cpu(eb->h_blkno)); |
ccd979bdb [PATCH] OCFS2: Th... |
1329 |
|
ec20cec7a ocfs2: Make ocfs2... |
1330 |
ocfs2_journal_dirty(handle, et->et_root_bh); |
ccd979bdb [PATCH] OCFS2: Th... |
1331 1332 1333 1334 1335 |
*ret_new_eb_bh = new_eb_bh; new_eb_bh = NULL; status = 0; bail: |
a81cb88b6 ocfs2: Don't chec... |
1336 |
brelse(new_eb_bh); |
ccd979bdb [PATCH] OCFS2: Th... |
1337 |
|
ccd979bdb [PATCH] OCFS2: Th... |
1338 1339 1340 1341 |
return status; } /* |
ccd979bdb [PATCH] OCFS2: Th... |
1342 1343 1344 1345 1346 1347 1348 1349 |
* Should only be called when there is no space left in any of the * leaf nodes. What we want to do is find the lowest tree depth * non-leaf extent block with room for new records. There are three * valid results of this search: * * 1) a lowest extent block is found, then we pass it back in * *lowest_eb_bh and return '0' * |
e7d4cb6bc ocfs2: Abstract o... |
1350 |
* 2) the search fails to find anything, but the root_el has room. We |
ccd979bdb [PATCH] OCFS2: Th... |
1351 1352 |
* pass NULL back in *lowest_eb_bh, but still return '0' * |
e7d4cb6bc ocfs2: Abstract o... |
1353 |
* 3) the search fails to find anything AND the root_el is full, in |
ccd979bdb [PATCH] OCFS2: Th... |
1354 1355 1356 1357 |
* which case we return > 0 * * return status < 0 indicates an error. */ |
d401dc12f ocfs2: ocfs2_grow... |
1358 |
static int ocfs2_find_branch_target(struct ocfs2_extent_tree *et, |
ccd979bdb [PATCH] OCFS2: Th... |
1359 1360 1361 1362 |
struct buffer_head **target_bh) { int status = 0, i; u64 blkno; |
ccd979bdb [PATCH] OCFS2: Th... |
1363 1364 1365 1366 |
struct ocfs2_extent_block *eb; struct ocfs2_extent_list *el; struct buffer_head *bh = NULL; struct buffer_head *lowest_bh = NULL; |
ccd979bdb [PATCH] OCFS2: Th... |
1367 |
*target_bh = NULL; |
ce1d9ea62 ocfs2: Prefix the... |
1368 |
el = et->et_root_el; |
ccd979bdb [PATCH] OCFS2: Th... |
1369 1370 1371 |
while(le16_to_cpu(el->l_tree_depth) > 1) { if (le16_to_cpu(el->l_next_free_rec) == 0) { |
3d03a305d ocfs2: Pass ocfs2... |
1372 |
ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci), |
7ecef14ab ocfs2: neaten do_... |
1373 1374 |
"Owner %llu has empty extent list (next_free_rec == 0) ", |
3d03a305d ocfs2: Pass ocfs2... |
1375 |
(unsigned long long)ocfs2_metadata_cache_owner(et->et_ci)); |
ccd979bdb [PATCH] OCFS2: Th... |
1376 1377 1378 1379 1380 1381 |
status = -EIO; goto bail; } i = le16_to_cpu(el->l_next_free_rec) - 1; blkno = le64_to_cpu(el->l_recs[i].e_blkno); if (!blkno) { |
3d03a305d ocfs2: Pass ocfs2... |
1382 |
ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci), |
7ecef14ab ocfs2: neaten do_... |
1383 1384 |
"Owner %llu has extent list where extent # %d has no physical block start ", |
3d03a305d ocfs2: Pass ocfs2... |
1385 |
(unsigned long long)ocfs2_metadata_cache_owner(et->et_ci), i); |
ccd979bdb [PATCH] OCFS2: Th... |
1386 1387 1388 |
status = -EIO; goto bail; } |
a81cb88b6 ocfs2: Don't chec... |
1389 1390 |
brelse(bh); bh = NULL; |
ccd979bdb [PATCH] OCFS2: Th... |
1391 |
|
3d03a305d ocfs2: Pass ocfs2... |
1392 |
status = ocfs2_read_extent_block(et->et_ci, blkno, &bh); |
ccd979bdb [PATCH] OCFS2: Th... |
1393 1394 1395 1396 |
if (status < 0) { mlog_errno(status); goto bail; } |
dcd0538ff ocfs2: sparse b-t... |
1397 1398 |
eb = (struct ocfs2_extent_block *) bh->b_data; |
dcd0538ff ocfs2: sparse b-t... |
1399 1400 1401 1402 |
el = &eb->h_list; if (le16_to_cpu(el->l_next_free_rec) < le16_to_cpu(el->l_count)) { |
a81cb88b6 ocfs2: Don't chec... |
1403 |
brelse(lowest_bh); |
dcd0538ff ocfs2: sparse b-t... |
1404 1405 1406 1407 1408 1409 1410 |
lowest_bh = bh; get_bh(lowest_bh); } } /* If we didn't find one and the fe doesn't have any room, * then return '1' */ |
ce1d9ea62 ocfs2: Prefix the... |
1411 |
el = et->et_root_el; |
e7d4cb6bc ocfs2: Abstract o... |
1412 |
if (!lowest_bh && (el->l_next_free_rec == el->l_count)) |
dcd0538ff ocfs2: sparse b-t... |
1413 1414 1415 1416 |
status = 1; *target_bh = lowest_bh; bail: |
a81cb88b6 ocfs2: Don't chec... |
1417 |
brelse(bh); |
dcd0538ff ocfs2: sparse b-t... |
1418 |
|
dcd0538ff ocfs2: sparse b-t... |
1419 1420 |
return status; } |
e48edee2d ocfs2: make room ... |
1421 |
/* |
c3afcbb34 ocfs2: abstract b... |
1422 1423 1424 1425 1426 1427 |
* Grow a b-tree so that it has more records. * * We might shift the tree depth in which case existing paths should * be considered invalid. * * Tree depth after the grow is returned via *final_depth. |
328d5752e ocfs2: btree chan... |
1428 1429 |
* * *last_eb_bh will be updated by ocfs2_add_branch(). |
c3afcbb34 ocfs2: abstract b... |
1430 |
*/ |
d401dc12f ocfs2: ocfs2_grow... |
1431 1432 |
static int ocfs2_grow_tree(handle_t *handle, struct ocfs2_extent_tree *et, int *final_depth, struct buffer_head **last_eb_bh, |
c3afcbb34 ocfs2: abstract b... |
1433 1434 1435 |
struct ocfs2_alloc_context *meta_ac) { int ret, shift; |
ce1d9ea62 ocfs2: Prefix the... |
1436 |
struct ocfs2_extent_list *el = et->et_root_el; |
e7d4cb6bc ocfs2: Abstract o... |
1437 |
int depth = le16_to_cpu(el->l_tree_depth); |
c3afcbb34 ocfs2: abstract b... |
1438 1439 1440 |
struct buffer_head *bh = NULL; BUG_ON(meta_ac == NULL); |
d401dc12f ocfs2: ocfs2_grow... |
1441 |
shift = ocfs2_find_branch_target(et, &bh); |
c3afcbb34 ocfs2: abstract b... |
1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 |
if (shift < 0) { ret = shift; mlog_errno(ret); goto out; } /* We traveled all the way to the bottom of the allocation tree * and didn't find room for any more extents - we need to add * another tree level */ if (shift) { BUG_ON(bh); |
a09d09b8f ocfs2: Remove mlo... |
1453 1454 1455 1456 |
trace_ocfs2_grow_tree( (unsigned long long) ocfs2_metadata_cache_owner(et->et_ci), depth); |
c3afcbb34 ocfs2: abstract b... |
1457 1458 1459 1460 |
/* ocfs2_shift_tree_depth will return us a buffer with * the new extent block (so we can pass that to * ocfs2_add_branch). */ |
d401dc12f ocfs2: ocfs2_grow... |
1461 |
ret = ocfs2_shift_tree_depth(handle, et, meta_ac, &bh); |
c3afcbb34 ocfs2: abstract b... |
1462 1463 1464 1465 1466 |
if (ret < 0) { mlog_errno(ret); goto out; } depth++; |
328d5752e ocfs2: btree chan... |
1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 |
if (depth == 1) { /* * Special case: we have room now if we shifted from * tree_depth 0, so no more work needs to be done. * * We won't be calling add_branch, so pass * back *last_eb_bh as the new leaf. At depth * zero, it should always be null so there's * no reason to brelse. */ BUG_ON(*last_eb_bh); get_bh(bh); *last_eb_bh = bh; |
c3afcbb34 ocfs2: abstract b... |
1480 |
goto out; |
328d5752e ocfs2: btree chan... |
1481 |
} |
c3afcbb34 ocfs2: abstract b... |
1482 1483 1484 1485 |
} /* call ocfs2_add_branch to add the final part of the tree with * the new data. */ |
d401dc12f ocfs2: ocfs2_grow... |
1486 |
ret = ocfs2_add_branch(handle, et, bh, last_eb_bh, |
c3afcbb34 ocfs2: abstract b... |
1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 |
meta_ac); if (ret < 0) { mlog_errno(ret); goto out; } out: if (final_depth) *final_depth = depth; brelse(bh); return ret; } /* |
dcd0538ff ocfs2: sparse b-t... |
1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 |
* This function will discard the rightmost extent record. */ static void ocfs2_shift_records_right(struct ocfs2_extent_list *el) { int next_free = le16_to_cpu(el->l_next_free_rec); int count = le16_to_cpu(el->l_count); unsigned int num_bytes; BUG_ON(!next_free); /* This will cause us to go off the end of our extent list. */ BUG_ON(next_free >= count); num_bytes = sizeof(struct ocfs2_extent_rec) * next_free; memmove(&el->l_recs[1], &el->l_recs[0], num_bytes); } static void ocfs2_rotate_leaf(struct ocfs2_extent_list *el, struct ocfs2_extent_rec *insert_rec) { int i, insert_index, next_free, has_empty, num_bytes; u32 insert_cpos = le32_to_cpu(insert_rec->e_cpos); struct ocfs2_extent_rec *rec; next_free = le16_to_cpu(el->l_next_free_rec); has_empty = ocfs2_is_empty_extent(&el->l_recs[0]); BUG_ON(!next_free); /* The tree code before us didn't allow enough room in the leaf. */ |
b1f3550fa ocfs2: Use BUG_ON |
1531 |
BUG_ON(el->l_next_free_rec == el->l_count && !has_empty); |
dcd0538ff ocfs2: sparse b-t... |
1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 |
/* * The easiest way to approach this is to just remove the * empty extent and temporarily decrement next_free. */ if (has_empty) { /* * If next_free was 1 (only an empty extent), this * loop won't execute, which is fine. We still want * the decrement above to happen. */ for(i = 0; i < (next_free - 1); i++) el->l_recs[i] = el->l_recs[i+1]; next_free--; } /* * Figure out what the new record index should be. */ for(i = 0; i < next_free; i++) { rec = &el->l_recs[i]; if (insert_cpos < le32_to_cpu(rec->e_cpos)) break; } insert_index = i; |
a09d09b8f ocfs2: Remove mlo... |
1559 1560 1561 |
trace_ocfs2_rotate_leaf(insert_cpos, insert_index, has_empty, next_free, le16_to_cpu(el->l_count)); |
dcd0538ff ocfs2: sparse b-t... |
1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 |
BUG_ON(insert_index < 0); BUG_ON(insert_index >= le16_to_cpu(el->l_count)); BUG_ON(insert_index > next_free); /* * No need to memmove if we're just adding to the tail. */ if (insert_index != next_free) { BUG_ON(next_free >= le16_to_cpu(el->l_count)); num_bytes = next_free - insert_index; num_bytes *= sizeof(struct ocfs2_extent_rec); memmove(&el->l_recs[insert_index + 1], &el->l_recs[insert_index], num_bytes); } /* * Either we had an empty extent, and need to re-increment or * there was no empty extent on a non full rightmost leaf node, * in which case we still need to increment. */ next_free++; el->l_next_free_rec = cpu_to_le16(next_free); /* * Make sure none of the math above just messed up our tree. */ BUG_ON(le16_to_cpu(el->l_next_free_rec) > le16_to_cpu(el->l_count)); el->l_recs[insert_index] = *insert_rec; } |
328d5752e ocfs2: btree chan... |
1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 |
static void ocfs2_remove_empty_extent(struct ocfs2_extent_list *el) { int size, num_recs = le16_to_cpu(el->l_next_free_rec); BUG_ON(num_recs == 0); if (ocfs2_is_empty_extent(&el->l_recs[0])) { num_recs--; size = num_recs * sizeof(struct ocfs2_extent_rec); memmove(&el->l_recs[0], &el->l_recs[1], size); memset(&el->l_recs[num_recs], 0, sizeof(struct ocfs2_extent_rec)); el->l_next_free_rec = cpu_to_le16(num_recs); } } |
dcd0538ff ocfs2: sparse b-t... |
1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 |
/* * Create an empty extent record . * * l_next_free_rec may be updated. * * If an empty extent already exists do nothing. */ static void ocfs2_create_empty_extent(struct ocfs2_extent_list *el) { int next_free = le16_to_cpu(el->l_next_free_rec); |
e48edee2d ocfs2: make room ... |
1620 |
BUG_ON(le16_to_cpu(el->l_tree_depth) != 0); |
dcd0538ff ocfs2: sparse b-t... |
1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 |
if (next_free == 0) goto set_and_inc; if (ocfs2_is_empty_extent(&el->l_recs[0])) return; mlog_bug_on_msg(el->l_count == el->l_next_free_rec, "Asked to create an empty extent in a full list: " "count = %u, tree depth = %u", le16_to_cpu(el->l_count), le16_to_cpu(el->l_tree_depth)); ocfs2_shift_records_right(el); set_and_inc: le16_add_cpu(&el->l_next_free_rec, 1); memset(&el->l_recs[0], 0, sizeof(struct ocfs2_extent_rec)); } /* * For a rotation which involves two leaf nodes, the "root node" is * the lowest level tree node which contains a path to both leafs. This * resulting set of information can be used to form a complete "subtree" * * This function is passed two full paths from the dinode down to a * pair of adjacent leaves. It's task is to figure out which path * index contains the subtree root - this can be the root index itself * in a worst-case rotation. * * The array index of the subtree root is passed back. */ |
38a04e432 ocfs2: Find prope... |
1653 1654 1655 |
int ocfs2_find_subtree_root(struct ocfs2_extent_tree *et, struct ocfs2_path *left, struct ocfs2_path *right) |
dcd0538ff ocfs2: sparse b-t... |
1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 |
{ int i = 0; /* * Check that the caller passed in two paths from the same tree. */ BUG_ON(path_root_bh(left) != path_root_bh(right)); do { i++; /* * The caller didn't pass two adjacent paths. */ mlog_bug_on_msg(i > left->p_tree_depth, |
7dc028056 ocfs2: Pass ocfs2... |
1671 1672 |
"Owner %llu, left depth %u, right depth %u " |
dcd0538ff ocfs2: sparse b-t... |
1673 1674 |
"left leaf blk %llu, right leaf blk %llu ", |
7dc028056 ocfs2: Pass ocfs2... |
1675 1676 |
(unsigned long long)ocfs2_metadata_cache_owner(et->et_ci), left->p_tree_depth, right->p_tree_depth, |
dcd0538ff ocfs2: sparse b-t... |
1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 |
(unsigned long long)path_leaf_bh(left)->b_blocknr, (unsigned long long)path_leaf_bh(right)->b_blocknr); } while (left->p_node[i].bh->b_blocknr == right->p_node[i].bh->b_blocknr); return i - 1; } typedef void (path_insert_t)(void *, struct buffer_head *); /* * Traverse a btree path in search of cpos, starting at root_el. * * This code can be called with a cpos larger than the tree, in which * case it will return the rightmost path. */ |
facdb77f5 ocfs2: ocfs2_find... |
1693 |
static int __ocfs2_find_path(struct ocfs2_caching_info *ci, |
dcd0538ff ocfs2: sparse b-t... |
1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 |
struct ocfs2_extent_list *root_el, u32 cpos, path_insert_t *func, void *data) { int i, ret = 0; u32 range; u64 blkno; struct buffer_head *bh = NULL; struct ocfs2_extent_block *eb; struct ocfs2_extent_list *el; struct ocfs2_extent_rec *rec; |
dcd0538ff ocfs2: sparse b-t... |
1704 1705 1706 1707 |
el = root_el; while (el->l_tree_depth) { if (le16_to_cpu(el->l_next_free_rec) == 0) { |
facdb77f5 ocfs2: ocfs2_find... |
1708 |
ocfs2_error(ocfs2_metadata_cache_get_super(ci), |
7ecef14ab ocfs2: neaten do_... |
1709 1710 |
"Owner %llu has empty extent list at depth %u ", |
facdb77f5 ocfs2: ocfs2_find... |
1711 |
(unsigned long long)ocfs2_metadata_cache_owner(ci), |
dcd0538ff ocfs2: sparse b-t... |
1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 |
le16_to_cpu(el->l_tree_depth)); ret = -EROFS; goto out; } for(i = 0; i < le16_to_cpu(el->l_next_free_rec) - 1; i++) { rec = &el->l_recs[i]; /* * In the case that cpos is off the allocation * tree, this should just wind up returning the * rightmost record. */ range = le32_to_cpu(rec->e_cpos) + |
e48edee2d ocfs2: make room ... |
1727 |
ocfs2_rec_clusters(el, rec); |
dcd0538ff ocfs2: sparse b-t... |
1728 1729 1730 1731 1732 1733 |
if (cpos >= le32_to_cpu(rec->e_cpos) && cpos < range) break; } blkno = le64_to_cpu(el->l_recs[i].e_blkno); if (blkno == 0) { |
facdb77f5 ocfs2: ocfs2_find... |
1734 |
ocfs2_error(ocfs2_metadata_cache_get_super(ci), |
7ecef14ab ocfs2: neaten do_... |
1735 1736 |
"Owner %llu has bad blkno in extent list at depth %u (index %d) ", |
facdb77f5 ocfs2: ocfs2_find... |
1737 |
(unsigned long long)ocfs2_metadata_cache_owner(ci), |
dcd0538ff ocfs2: sparse b-t... |
1738 1739 1740 1741 1742 1743 1744 |
le16_to_cpu(el->l_tree_depth), i); ret = -EROFS; goto out; } brelse(bh); bh = NULL; |
facdb77f5 ocfs2: ocfs2_find... |
1745 |
ret = ocfs2_read_extent_block(ci, blkno, &bh); |
dcd0538ff ocfs2: sparse b-t... |
1746 1747 1748 1749 1750 1751 1752 |
if (ret) { mlog_errno(ret); goto out; } eb = (struct ocfs2_extent_block *) bh->b_data; el = &eb->h_list; |
dcd0538ff ocfs2: sparse b-t... |
1753 1754 1755 |
if (le16_to_cpu(el->l_next_free_rec) > le16_to_cpu(el->l_count)) { |
facdb77f5 ocfs2: ocfs2_find... |
1756 |
ocfs2_error(ocfs2_metadata_cache_get_super(ci), |
7ecef14ab ocfs2: neaten do_... |
1757 1758 |
"Owner %llu has bad count in extent list at block %llu (next free=%u, count=%u) ", |
facdb77f5 ocfs2: ocfs2_find... |
1759 |
(unsigned long long)ocfs2_metadata_cache_owner(ci), |
dcd0538ff ocfs2: sparse b-t... |
1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 |
(unsigned long long)bh->b_blocknr, le16_to_cpu(el->l_next_free_rec), le16_to_cpu(el->l_count)); ret = -EROFS; goto out; } if (func) func(data, bh); } out: /* * Catch any trailing bh that the loop didn't handle. */ brelse(bh); return ret; } /* * Given an initialized path (that is, it has a valid root extent * list), this function will traverse the btree in search of the path * which would contain cpos. * * The path traveled is recorded in the path structure. * * Note that this will not do any comparisons on leaf node extent * records, so it will work fine in the case that we just added a tree * branch. */ struct find_path_data { int index; struct ocfs2_path *path; }; static void find_path_ins(void *data, struct buffer_head *bh) { struct find_path_data *fp = data; get_bh(bh); ocfs2_path_insert_eb(fp->path, fp->index, bh); fp->index++; } |
e2e9f6082 ocfs2: move tree ... |
1803 1804 |
int ocfs2_find_path(struct ocfs2_caching_info *ci, struct ocfs2_path *path, u32 cpos) |
dcd0538ff ocfs2: sparse b-t... |
1805 1806 1807 1808 1809 |
{ struct find_path_data data; data.index = 1; data.path = path; |
facdb77f5 ocfs2: ocfs2_find... |
1810 |
return __ocfs2_find_path(ci, path_root_el(path), cpos, |
dcd0538ff ocfs2: sparse b-t... |
1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 |
find_path_ins, &data); } static void find_leaf_ins(void *data, struct buffer_head *bh) { struct ocfs2_extent_block *eb =(struct ocfs2_extent_block *)bh->b_data; struct ocfs2_extent_list *el = &eb->h_list; struct buffer_head **ret = data; /* We want to retain only the leaf block. */ if (le16_to_cpu(el->l_tree_depth) == 0) { get_bh(bh); *ret = bh; } } /* * Find the leaf block in the tree which would contain cpos. No * checking of the actual leaf is done. * * Some paths want to call this instead of allocating a path structure * and calling ocfs2_find_path(). * * This function doesn't handle non btree extent lists. */ |
facdb77f5 ocfs2: ocfs2_find... |
1835 1836 1837 |
int ocfs2_find_leaf(struct ocfs2_caching_info *ci, struct ocfs2_extent_list *root_el, u32 cpos, struct buffer_head **leaf_bh) |
dcd0538ff ocfs2: sparse b-t... |
1838 1839 1840 |
{ int ret; struct buffer_head *bh = NULL; |
facdb77f5 ocfs2: ocfs2_find... |
1841 |
ret = __ocfs2_find_path(ci, root_el, cpos, find_leaf_ins, &bh); |
dcd0538ff ocfs2: sparse b-t... |
1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 |
if (ret) { mlog_errno(ret); goto out; } *leaf_bh = bh; out: return ret; } /* * Adjust the adjacent records (left_rec, right_rec) involved in a rotation. * * Basically, we've moved stuff around at the bottom of the tree and * we need to fix up the extent records above the changes to reflect * the new changes. * * left_rec: the record on the left. |
dcd0538ff ocfs2: sparse b-t... |
1860 1861 1862 1863 1864 1865 |
* right_rec: the record to the right of left_rec * right_child_el: is the child list pointed to by right_rec * * By definition, this only works on interior nodes. */ static void ocfs2_adjust_adjacent_records(struct ocfs2_extent_rec *left_rec, |
dcd0538ff ocfs2: sparse b-t... |
1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 |
struct ocfs2_extent_rec *right_rec, struct ocfs2_extent_list *right_child_el) { u32 left_clusters, right_end; /* * Interior nodes never have holes. Their cpos is the cpos of * the leftmost record in their child list. Their cluster * count covers the full theoretical range of their child list * - the range between their cpos and the cpos of the record * immediately to their right. */ left_clusters = le32_to_cpu(right_child_el->l_recs[0].e_cpos); |
82e12644c ocfs2: Use ocfs2_... |
1879 1880 |
if (!ocfs2_rec_clusters(right_child_el, &right_child_el->l_recs[0])) { BUG_ON(right_child_el->l_tree_depth); |
328d5752e ocfs2: btree chan... |
1881 1882 1883 |
BUG_ON(le16_to_cpu(right_child_el->l_next_free_rec) <= 1); left_clusters = le32_to_cpu(right_child_el->l_recs[1].e_cpos); } |
dcd0538ff ocfs2: sparse b-t... |
1884 |
left_clusters -= le32_to_cpu(left_rec->e_cpos); |
e48edee2d ocfs2: make room ... |
1885 |
left_rec->e_int_clusters = cpu_to_le32(left_clusters); |
dcd0538ff ocfs2: sparse b-t... |
1886 1887 1888 |
/* * Calculate the rightmost cluster count boundary before |
e48edee2d ocfs2: make room ... |
1889 |
* moving cpos - we will need to adjust clusters after |
dcd0538ff ocfs2: sparse b-t... |
1890 1891 1892 |
* updating e_cpos to keep the same highest cluster count. */ right_end = le32_to_cpu(right_rec->e_cpos); |
e48edee2d ocfs2: make room ... |
1893 |
right_end += le32_to_cpu(right_rec->e_int_clusters); |
dcd0538ff ocfs2: sparse b-t... |
1894 1895 1896 1897 1898 |
right_rec->e_cpos = left_rec->e_cpos; le32_add_cpu(&right_rec->e_cpos, left_clusters); right_end -= le32_to_cpu(right_rec->e_cpos); |
e48edee2d ocfs2: make room ... |
1899 |
right_rec->e_int_clusters = cpu_to_le32(right_end); |
dcd0538ff ocfs2: sparse b-t... |
1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 |
} /* * Adjust the adjacent root node records involved in a * rotation. left_el_blkno is passed in as a key so that we can easily * find it's index in the root list. */ static void ocfs2_adjust_root_records(struct ocfs2_extent_list *root_el, struct ocfs2_extent_list *left_el, struct ocfs2_extent_list *right_el, u64 left_el_blkno) { int i; BUG_ON(le16_to_cpu(root_el->l_tree_depth) <= le16_to_cpu(left_el->l_tree_depth)); for(i = 0; i < le16_to_cpu(root_el->l_next_free_rec) - 1; i++) { if (le64_to_cpu(root_el->l_recs[i].e_blkno) == left_el_blkno) break; } /* * The path walking code should have never returned a root and * two paths which are not adjacent. */ BUG_ON(i >= (le16_to_cpu(root_el->l_next_free_rec) - 1)); |
964f14a0d ocfs2: clean up s... |
1927 |
ocfs2_adjust_adjacent_records(&root_el->l_recs[i], |
dcd0538ff ocfs2: sparse b-t... |
1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 |
&root_el->l_recs[i + 1], right_el); } /* * We've changed a leaf block (in right_path) and need to reflect that * change back up the subtree. * * This happens in multiple places: * - When we've moved an extent record from the left path leaf to the right * path leaf to make room for an empty extent in the left path leaf. * - When our insert into the right path leaf is at the leftmost edge * and requires an update of the path immediately to it's left. This * can occur at the end of some types of rotation and appending inserts. |
677b97528 ocfs2: Add suppor... |
1941 1942 |
* - When we've adjusted the last extent record in the left path leaf and the * 1st extent record in the right path leaf during cross extent block merge. |
dcd0538ff ocfs2: sparse b-t... |
1943 |
*/ |
4619c73e7 ocfs2: ocfs2_comp... |
1944 |
static void ocfs2_complete_edge_insert(handle_t *handle, |
dcd0538ff ocfs2: sparse b-t... |
1945 1946 1947 1948 |
struct ocfs2_path *left_path, struct ocfs2_path *right_path, int subtree_index) { |
ec20cec7a ocfs2: Make ocfs2... |
1949 |
int i, idx; |
dcd0538ff ocfs2: sparse b-t... |
1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 |
struct ocfs2_extent_list *el, *left_el, *right_el; struct ocfs2_extent_rec *left_rec, *right_rec; struct buffer_head *root_bh = left_path->p_node[subtree_index].bh; /* * Update the counts and position values within all the * interior nodes to reflect the leaf rotation we just did. * * The root node is handled below the loop. * * We begin the loop with right_el and left_el pointing to the * leaf lists and work our way up. * * NOTE: within this loop, left_el and right_el always refer * to the *child* lists. */ left_el = path_leaf_el(left_path); right_el = path_leaf_el(right_path); for(i = left_path->p_tree_depth - 1; i > subtree_index; i--) { |
a09d09b8f ocfs2: Remove mlo... |
1969 |
trace_ocfs2_complete_edge_insert(i); |
dcd0538ff ocfs2: sparse b-t... |
1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 |
/* * One nice property of knowing that all of these * nodes are below the root is that we only deal with * the leftmost right node record and the rightmost * left node record. */ el = left_path->p_node[i].el; idx = le16_to_cpu(left_el->l_next_free_rec) - 1; left_rec = &el->l_recs[idx]; el = right_path->p_node[i].el; right_rec = &el->l_recs[0]; |
964f14a0d ocfs2: clean up s... |
1983 |
ocfs2_adjust_adjacent_records(left_rec, right_rec, right_el); |
dcd0538ff ocfs2: sparse b-t... |
1984 |
|
ec20cec7a ocfs2: Make ocfs2... |
1985 1986 |
ocfs2_journal_dirty(handle, left_path->p_node[i].bh); ocfs2_journal_dirty(handle, right_path->p_node[i].bh); |
dcd0538ff ocfs2: sparse b-t... |
1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 |
/* * Setup our list pointers now so that the current * parents become children in the next iteration. */ left_el = left_path->p_node[i].el; right_el = right_path->p_node[i].el; } /* * At the root node, adjust the two adjacent records which * begin our path to the leaves. */ el = left_path->p_node[subtree_index].el; left_el = left_path->p_node[subtree_index + 1].el; right_el = right_path->p_node[subtree_index + 1].el; ocfs2_adjust_root_records(el, left_el, right_el, left_path->p_node[subtree_index + 1].bh->b_blocknr); root_bh = left_path->p_node[subtree_index].bh; |
ec20cec7a ocfs2: Make ocfs2... |
2009 |
ocfs2_journal_dirty(handle, root_bh); |
dcd0538ff ocfs2: sparse b-t... |
2010 |
} |
5c601aba8 ocfs2: Get inode ... |
2011 2012 |
static int ocfs2_rotate_subtree_right(handle_t *handle, struct ocfs2_extent_tree *et, |
dcd0538ff ocfs2: sparse b-t... |
2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 |
struct ocfs2_path *left_path, struct ocfs2_path *right_path, int subtree_index) { int ret, i; struct buffer_head *right_leaf_bh; struct buffer_head *left_leaf_bh = NULL; struct buffer_head *root_bh; struct ocfs2_extent_list *right_el, *left_el; struct ocfs2_extent_rec move_rec; left_leaf_bh = path_leaf_bh(left_path); left_el = path_leaf_el(left_path); if (left_el->l_next_free_rec != left_el->l_count) { |
5c601aba8 ocfs2: Get inode ... |
2028 |
ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci), |
7ecef14ab ocfs2: neaten do_... |
2029 2030 |
"Inode %llu has non-full interior leaf node %llu (next free = %u) ", |
5c601aba8 ocfs2: Get inode ... |
2031 |
(unsigned long long)ocfs2_metadata_cache_owner(et->et_ci), |
dcd0538ff ocfs2: sparse b-t... |
2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 |
(unsigned long long)left_leaf_bh->b_blocknr, le16_to_cpu(left_el->l_next_free_rec)); return -EROFS; } /* * This extent block may already have an empty record, so we * return early if so. */ if (ocfs2_is_empty_extent(&left_el->l_recs[0])) return 0; root_bh = left_path->p_node[subtree_index].bh; BUG_ON(root_bh != right_path->p_node[subtree_index].bh); |
5c601aba8 ocfs2: Get inode ... |
2046 |
ret = ocfs2_path_bh_journal_access(handle, et->et_ci, right_path, |
13723d00e ocfs2: Use metada... |
2047 |
subtree_index); |
dcd0538ff ocfs2: sparse b-t... |
2048 2049 2050 2051 2052 2053 |
if (ret) { mlog_errno(ret); goto out; } for(i = subtree_index + 1; i < path_num_items(right_path); i++) { |
5c601aba8 ocfs2: Get inode ... |
2054 |
ret = ocfs2_path_bh_journal_access(handle, et->et_ci, |
13723d00e ocfs2: Use metada... |
2055 |
right_path, i); |
dcd0538ff ocfs2: sparse b-t... |
2056 2057 2058 2059 |
if (ret) { mlog_errno(ret); goto out; } |
5c601aba8 ocfs2: Get inode ... |
2060 |
ret = ocfs2_path_bh_journal_access(handle, et->et_ci, |
13723d00e ocfs2: Use metada... |
2061 |
left_path, i); |
dcd0538ff ocfs2: sparse b-t... |
2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 |
if (ret) { mlog_errno(ret); goto out; } } right_leaf_bh = path_leaf_bh(right_path); right_el = path_leaf_el(right_path); /* This is a code error, not a disk corruption. */ mlog_bug_on_msg(!right_el->l_next_free_rec, "Inode %llu: Rotate fails " "because rightmost leaf block %llu is empty ", |
5c601aba8 ocfs2: Get inode ... |
2075 |
(unsigned long long)ocfs2_metadata_cache_owner(et->et_ci), |
dcd0538ff ocfs2: sparse b-t... |
2076 2077 2078 |
(unsigned long long)right_leaf_bh->b_blocknr); ocfs2_create_empty_extent(right_el); |
ec20cec7a ocfs2: Make ocfs2... |
2079 |
ocfs2_journal_dirty(handle, right_leaf_bh); |
dcd0538ff ocfs2: sparse b-t... |
2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 |
/* Do the copy now. */ i = le16_to_cpu(left_el->l_next_free_rec) - 1; move_rec = left_el->l_recs[i]; right_el->l_recs[0] = move_rec; /* * Clear out the record we just copied and shift everything * over, leaving an empty extent in the left leaf. * * We temporarily subtract from next_free_rec so that the * shift will lose the tail record (which is now defunct). */ le16_add_cpu(&left_el->l_next_free_rec, -1); ocfs2_shift_records_right(left_el); memset(&left_el->l_recs[0], 0, sizeof(struct ocfs2_extent_rec)); le16_add_cpu(&left_el->l_next_free_rec, 1); |
ec20cec7a ocfs2: Make ocfs2... |
2097 |
ocfs2_journal_dirty(handle, left_leaf_bh); |
dcd0538ff ocfs2: sparse b-t... |
2098 |
|
4619c73e7 ocfs2: ocfs2_comp... |
2099 2100 |
ocfs2_complete_edge_insert(handle, left_path, right_path, subtree_index); |
dcd0538ff ocfs2: sparse b-t... |
2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 |
out: return ret; } /* * Given a full path, determine what cpos value would return us a path * containing the leaf immediately to the left of the current one. * * Will return zero if the path passed in is already the leftmost path. */ |
ee149a7c6 Ocfs2: Make ocfs2... |
2112 2113 |
int ocfs2_find_cpos_for_left_leaf(struct super_block *sb, struct ocfs2_path *path, u32 *cpos) |
dcd0538ff ocfs2: sparse b-t... |
2114 2115 2116 2117 |
{ int i, j, ret = 0; u64 blkno; struct ocfs2_extent_list *el; |
e48edee2d ocfs2: make room ... |
2118 |
BUG_ON(path->p_tree_depth == 0); |
dcd0538ff ocfs2: sparse b-t... |
2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 |
*cpos = 0; blkno = path_leaf_bh(path)->b_blocknr; /* Start at the tree node just above the leaf and work our way up. */ i = path->p_tree_depth - 1; while (i >= 0) { el = path->p_node[i].el; /* * Find the extent record just before the one in our * path. */ for(j = 0; j < le16_to_cpu(el->l_next_free_rec); j++) { if (le64_to_cpu(el->l_recs[j].e_blkno) == blkno) { if (j == 0) { if (i == 0) { /* * We've determined that the * path specified is already * the leftmost one - return a * cpos of zero. */ goto out; } /* * The leftmost record points to our * leaf - we need to travel up the * tree one level. */ goto next_node; } *cpos = le32_to_cpu(el->l_recs[j - 1].e_cpos); |
e48edee2d ocfs2: make room ... |
2153 2154 2155 |
*cpos = *cpos + ocfs2_rec_clusters(el, &el->l_recs[j - 1]); *cpos = *cpos - 1; |
dcd0538ff ocfs2: sparse b-t... |
2156 2157 2158 2159 2160 2161 2162 2163 |
goto out; } } /* * If we got here, we never found a valid node where * the tree indicated one should be. */ |
7ecef14ab ocfs2: neaten do_... |
2164 2165 |
ocfs2_error(sb, "Invalid extent tree at extent block %llu ", |
dcd0538ff ocfs2: sparse b-t... |
2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 |
(unsigned long long)blkno); ret = -EROFS; goto out; next_node: blkno = path->p_node[i].bh->b_blocknr; i--; } out: return ret; } |
328d5752e ocfs2: btree chan... |
2178 2179 2180 2181 2182 |
/* * Extend the transaction by enough credits to complete the rotation, * and still leave at least the original number of credits allocated * to this transaction. */ |
dcd0538ff ocfs2: sparse b-t... |
2183 |
static int ocfs2_extend_rotate_transaction(handle_t *handle, int subtree_depth, |
328d5752e ocfs2: btree chan... |
2184 |
int op_credits, |
dcd0538ff ocfs2: sparse b-t... |
2185 2186 |
struct ocfs2_path *path) { |
c901fb007 ocfs2: Make ocfs2... |
2187 |
int ret = 0; |
328d5752e ocfs2: btree chan... |
2188 |
int credits = (path->p_tree_depth - subtree_depth) * 2 + 1 + op_credits; |
dcd0538ff ocfs2: sparse b-t... |
2189 |
|
c901fb007 ocfs2: Make ocfs2... |
2190 |
if (handle->h_buffer_credits < credits) |
c18b812d1 ocfs2: Make trans... |
2191 2192 |
ret = ocfs2_extend_trans(handle, credits - handle->h_buffer_credits); |
dcd0538ff ocfs2: sparse b-t... |
2193 |
|
c901fb007 ocfs2: Make ocfs2... |
2194 |
return ret; |
dcd0538ff ocfs2: sparse b-t... |
2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 |
} /* * Trap the case where we're inserting into the theoretical range past * the _actual_ left leaf range. Otherwise, we'll rotate a record * whose cpos is less than ours into the right leaf. * * It's only necessary to look at the rightmost record of the left * leaf because the logic that calls us should ensure that the * theoretical ranges in the path components above the leaves are * correct. */ static int ocfs2_rotate_requires_path_adjustment(struct ocfs2_path *left_path, u32 insert_cpos) { struct ocfs2_extent_list *left_el; struct ocfs2_extent_rec *rec; int next_free; left_el = path_leaf_el(left_path); next_free = le16_to_cpu(left_el->l_next_free_rec); rec = &left_el->l_recs[next_free - 1]; if (insert_cpos > le32_to_cpu(rec->e_cpos)) return 1; return 0; } |
328d5752e ocfs2: btree chan... |
2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 |
static int ocfs2_leftmost_rec_contains(struct ocfs2_extent_list *el, u32 cpos) { int next_free = le16_to_cpu(el->l_next_free_rec); unsigned int range; struct ocfs2_extent_rec *rec; if (next_free == 0) return 0; rec = &el->l_recs[0]; if (ocfs2_is_empty_extent(rec)) { /* Empty list. */ if (next_free == 1) return 0; rec = &el->l_recs[1]; } range = le32_to_cpu(rec->e_cpos) + ocfs2_rec_clusters(el, rec); if (cpos >= le32_to_cpu(rec->e_cpos) && cpos < range) return 1; return 0; } |
dcd0538ff ocfs2: sparse b-t... |
2244 2245 2246 2247 2248 2249 2250 |
/* * Rotate all the records in a btree right one record, starting at insert_cpos. * * The path to the rightmost leaf should be passed in. * * The array is assumed to be large enough to hold an entire path (tree depth). * |
af901ca18 tree-wide: fix as... |
2251 |
* Upon successful return from this function: |
dcd0538ff ocfs2: sparse b-t... |
2252 2253 2254 2255 2256 2257 2258 2259 |
* * - The 'right_path' array will contain a path to the leaf block * whose range contains e_cpos. * - That leaf block will have a single empty extent in list index 0. * - In the case that the rotation requires a post-insert update, * *ret_left_path will contain a valid path which can be passed to * ocfs2_insert_path(). */ |
1bbf0b8d6 ocfs2: ocfs2_rota... |
2260 |
static int ocfs2_rotate_tree_right(handle_t *handle, |
5c601aba8 ocfs2: Get inode ... |
2261 |
struct ocfs2_extent_tree *et, |
328d5752e ocfs2: btree chan... |
2262 |
enum ocfs2_split_type split, |
dcd0538ff ocfs2: sparse b-t... |
2263 2264 2265 2266 |
u32 insert_cpos, struct ocfs2_path *right_path, struct ocfs2_path **ret_left_path) { |
328d5752e ocfs2: btree chan... |
2267 |
int ret, start, orig_credits = handle->h_buffer_credits; |
dcd0538ff ocfs2: sparse b-t... |
2268 2269 |
u32 cpos; struct ocfs2_path *left_path = NULL; |
5c601aba8 ocfs2: Get inode ... |
2270 |
struct super_block *sb = ocfs2_metadata_cache_get_super(et->et_ci); |
dcd0538ff ocfs2: sparse b-t... |
2271 2272 |
*ret_left_path = NULL; |
ffdd7a546 ocfs2: Wrap up th... |
2273 |
left_path = ocfs2_new_path_from_path(right_path); |
dcd0538ff ocfs2: sparse b-t... |
2274 2275 2276 2277 2278 |
if (!left_path) { ret = -ENOMEM; mlog_errno(ret); goto out; } |
5c601aba8 ocfs2: Get inode ... |
2279 |
ret = ocfs2_find_cpos_for_left_leaf(sb, right_path, &cpos); |
dcd0538ff ocfs2: sparse b-t... |
2280 2281 2282 2283 |
if (ret) { mlog_errno(ret); goto out; } |
a09d09b8f ocfs2: Remove mlo... |
2284 2285 2286 |
trace_ocfs2_rotate_tree_right( (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci), insert_cpos, cpos); |
dcd0538ff ocfs2: sparse b-t... |
2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 |
/* * What we want to do here is: * * 1) Start with the rightmost path. * * 2) Determine a path to the leaf block directly to the left * of that leaf. * * 3) Determine the 'subtree root' - the lowest level tree node * which contains a path to both leaves. * * 4) Rotate the subtree. * * 5) Find the next subtree by considering the left path to be * the new right path. * * The check at the top of this while loop also accepts * insert_cpos == cpos because cpos is only a _theoretical_ * value to get us the left path - insert_cpos might very well * be filling that hole. * * Stop at a cpos of '0' because we either started at the * leftmost branch (i.e., a tree with one branch and a * rotation inside of it), or we've gone as far as we can in * rotating subtrees. */ while (cpos && insert_cpos <= cpos) { |
a09d09b8f ocfs2: Remove mlo... |
2315 2316 2317 2318 |
trace_ocfs2_rotate_tree_right( (unsigned long long) ocfs2_metadata_cache_owner(et->et_ci), insert_cpos, cpos); |
dcd0538ff ocfs2: sparse b-t... |
2319 |
|
5c601aba8 ocfs2: Get inode ... |
2320 |
ret = ocfs2_find_path(et->et_ci, left_path, cpos); |
dcd0538ff ocfs2: sparse b-t... |
2321 2322 2323 2324 2325 2326 2327 |
if (ret) { mlog_errno(ret); goto out; } mlog_bug_on_msg(path_leaf_bh(left_path) == path_leaf_bh(right_path), |
5c601aba8 ocfs2: Get inode ... |
2328 |
"Owner %llu: error during insert of %u " |
dcd0538ff ocfs2: sparse b-t... |
2329 2330 2331 |
"(left path cpos %u) results in two identical " "paths ending at %llu ", |
5c601aba8 ocfs2: Get inode ... |
2332 2333 |
(unsigned long long)ocfs2_metadata_cache_owner(et->et_ci), insert_cpos, cpos, |
dcd0538ff ocfs2: sparse b-t... |
2334 2335 |
(unsigned long long) path_leaf_bh(left_path)->b_blocknr); |
328d5752e ocfs2: btree chan... |
2336 2337 |
if (split == SPLIT_NONE && ocfs2_rotate_requires_path_adjustment(left_path, |
dcd0538ff ocfs2: sparse b-t... |
2338 |
insert_cpos)) { |
dcd0538ff ocfs2: sparse b-t... |
2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 |
/* * We've rotated the tree as much as we * should. The rest is up to * ocfs2_insert_path() to complete, after the * record insertion. We indicate this * situation by returning the left path. * * The reason we don't adjust the records here * before the record insert is that an error * later might break the rule where a parent * record e_cpos will reflect the actual * e_cpos of the 1st nonempty record of the * child list. */ *ret_left_path = left_path; goto out_ret_path; } |
7dc028056 ocfs2: Pass ocfs2... |
2357 |
start = ocfs2_find_subtree_root(et, left_path, right_path); |
dcd0538ff ocfs2: sparse b-t... |
2358 |
|
a09d09b8f ocfs2: Remove mlo... |
2359 2360 2361 2362 |
trace_ocfs2_rotate_subtree(start, (unsigned long long) right_path->p_node[start].bh->b_blocknr, right_path->p_tree_depth); |
dcd0538ff ocfs2: sparse b-t... |
2363 2364 |
ret = ocfs2_extend_rotate_transaction(handle, start, |
328d5752e ocfs2: btree chan... |
2365 |
orig_credits, right_path); |
dcd0538ff ocfs2: sparse b-t... |
2366 2367 2368 2369 |
if (ret) { mlog_errno(ret); goto out; } |
5c601aba8 ocfs2: Get inode ... |
2370 |
ret = ocfs2_rotate_subtree_right(handle, et, left_path, |
dcd0538ff ocfs2: sparse b-t... |
2371 2372 2373 2374 2375 |
right_path, start); if (ret) { mlog_errno(ret); goto out; } |
328d5752e ocfs2: btree chan... |
2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 |
if (split != SPLIT_NONE && ocfs2_leftmost_rec_contains(path_leaf_el(right_path), insert_cpos)) { /* * A rotate moves the rightmost left leaf * record over to the leftmost right leaf * slot. If we're doing an extent split * instead of a real insert, then we have to * check that the extent to be split wasn't * just moved over. If it was, then we can * exit here, passing left_path back - * ocfs2_split_extent() is smart enough to * search both leaves. */ *ret_left_path = left_path; goto out_ret_path; } |
dcd0538ff ocfs2: sparse b-t... |
2393 2394 2395 2396 2397 2398 |
/* * There is no need to re-read the next right path * as we know that it'll be our current left * path. Optimize by copying values instead. */ ocfs2_mv_path(right_path, left_path); |
5c601aba8 ocfs2: Get inode ... |
2399 |
ret = ocfs2_find_cpos_for_left_leaf(sb, right_path, &cpos); |
dcd0538ff ocfs2: sparse b-t... |
2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 |
if (ret) { mlog_errno(ret); goto out; } } out: ocfs2_free_path(left_path); out_ret_path: return ret; } |
09106bae0 ocfs2: ocfs2_upda... |
2412 2413 |
static int ocfs2_update_edge_lengths(handle_t *handle, struct ocfs2_extent_tree *et, |
964f14a0d ocfs2: clean up s... |
2414 |
struct ocfs2_path *path) |
dcd0538ff ocfs2: sparse b-t... |
2415 |
{ |
3c5e10683 ocfs2: Add extra ... |
2416 |
int i, idx, ret; |
dcd0538ff ocfs2: sparse b-t... |
2417 |
struct ocfs2_extent_rec *rec; |
328d5752e ocfs2: btree chan... |
2418 2419 2420 |
struct ocfs2_extent_list *el; struct ocfs2_extent_block *eb; u32 range; |
dcd0538ff ocfs2: sparse b-t... |
2421 |
|
09106bae0 ocfs2: ocfs2_upda... |
2422 |
ret = ocfs2_journal_access_path(et->et_ci, handle, path); |
3c5e10683 ocfs2: Add extra ... |
2423 2424 2425 2426 |
if (ret) { mlog_errno(ret); goto out; } |
328d5752e ocfs2: btree chan... |
2427 2428 2429 |
/* Path should always be rightmost. */ eb = (struct ocfs2_extent_block *)path_leaf_bh(path)->b_data; BUG_ON(eb->h_next_leaf_blk != 0ULL); |
dcd0538ff ocfs2: sparse b-t... |
2430 |
|
328d5752e ocfs2: btree chan... |
2431 2432 2433 2434 2435 |
el = &eb->h_list; BUG_ON(le16_to_cpu(el->l_next_free_rec) == 0); idx = le16_to_cpu(el->l_next_free_rec) - 1; rec = &el->l_recs[idx]; range = le32_to_cpu(rec->e_cpos) + ocfs2_rec_clusters(el, rec); |
dcd0538ff ocfs2: sparse b-t... |
2436 |
|
328d5752e ocfs2: btree chan... |
2437 2438 2439 2440 |
for (i = 0; i < path->p_tree_depth; i++) { el = path->p_node[i].el; idx = le16_to_cpu(el->l_next_free_rec) - 1; rec = &el->l_recs[idx]; |
dcd0538ff ocfs2: sparse b-t... |
2441 |
|
328d5752e ocfs2: btree chan... |
2442 2443 |
rec->e_int_clusters = cpu_to_le32(range); le32_add_cpu(&rec->e_int_clusters, -le32_to_cpu(rec->e_cpos)); |
dcd0538ff ocfs2: sparse b-t... |
2444 |
|
328d5752e ocfs2: btree chan... |
2445 |
ocfs2_journal_dirty(handle, path->p_node[i].bh); |
dcd0538ff ocfs2: sparse b-t... |
2446 |
} |
3c5e10683 ocfs2: Add extra ... |
2447 2448 |
out: return ret; |
dcd0538ff ocfs2: sparse b-t... |
2449 |
} |
6641b0ce3 ocfs2: Pass ocfs2... |
2450 2451 |
static void ocfs2_unlink_path(handle_t *handle, struct ocfs2_extent_tree *et, |
328d5752e ocfs2: btree chan... |
2452 2453 |
struct ocfs2_cached_dealloc_ctxt *dealloc, struct ocfs2_path *path, int unlink_start) |
dcd0538ff ocfs2: sparse b-t... |
2454 |
{ |
328d5752e ocfs2: btree chan... |
2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 |
int ret, i; struct ocfs2_extent_block *eb; struct ocfs2_extent_list *el; struct buffer_head *bh; for(i = unlink_start; i < path_num_items(path); i++) { bh = path->p_node[i].bh; eb = (struct ocfs2_extent_block *)bh->b_data; /* * Not all nodes might have had their final count * decremented by the caller - handle this here. */ el = &eb->h_list; if (le16_to_cpu(el->l_next_free_rec) > 1) { mlog(ML_ERROR, "Inode %llu, attempted to remove extent block " "%llu with %u records ", |
6641b0ce3 ocfs2: Pass ocfs2... |
2474 |
(unsigned long long)ocfs2_metadata_cache_owner(et->et_ci), |
328d5752e ocfs2: btree chan... |
2475 2476 2477 2478 |
(unsigned long long)le64_to_cpu(eb->h_blkno), le16_to_cpu(el->l_next_free_rec)); ocfs2_journal_dirty(handle, bh); |
6641b0ce3 ocfs2: Pass ocfs2... |
2479 |
ocfs2_remove_from_cache(et->et_ci, bh); |
328d5752e ocfs2: btree chan... |
2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 |
continue; } el->l_next_free_rec = 0; memset(&el->l_recs[0], 0, sizeof(struct ocfs2_extent_rec)); ocfs2_journal_dirty(handle, bh); ret = ocfs2_cache_extent_block_free(dealloc, eb); if (ret) mlog_errno(ret); |
6641b0ce3 ocfs2: Pass ocfs2... |
2491 |
ocfs2_remove_from_cache(et->et_ci, bh); |
328d5752e ocfs2: btree chan... |
2492 |
} |
dcd0538ff ocfs2: sparse b-t... |
2493 |
} |
6641b0ce3 ocfs2: Pass ocfs2... |
2494 2495 |
static void ocfs2_unlink_subtree(handle_t *handle, struct ocfs2_extent_tree *et, |
328d5752e ocfs2: btree chan... |
2496 2497 2498 2499 |
struct ocfs2_path *left_path, struct ocfs2_path *right_path, int subtree_index, struct ocfs2_cached_dealloc_ctxt *dealloc) |
dcd0538ff ocfs2: sparse b-t... |
2500 |
{ |
328d5752e ocfs2: btree chan... |
2501 2502 2503 |
int i; struct buffer_head *root_bh = left_path->p_node[subtree_index].bh; struct ocfs2_extent_list *root_el = left_path->p_node[subtree_index].el; |
dcd0538ff ocfs2: sparse b-t... |
2504 |
struct ocfs2_extent_list *el; |
328d5752e ocfs2: btree chan... |
2505 |
struct ocfs2_extent_block *eb; |
dcd0538ff ocfs2: sparse b-t... |
2506 |
|
328d5752e ocfs2: btree chan... |
2507 |
el = path_leaf_el(left_path); |
dcd0538ff ocfs2: sparse b-t... |
2508 |
|
328d5752e ocfs2: btree chan... |
2509 |
eb = (struct ocfs2_extent_block *)right_path->p_node[subtree_index + 1].bh->b_data; |
e48edee2d ocfs2: make room ... |
2510 |
|
328d5752e ocfs2: btree chan... |
2511 2512 2513 |
for(i = 1; i < le16_to_cpu(root_el->l_next_free_rec); i++) if (root_el->l_recs[i].e_blkno == eb->h_blkno) break; |
dcd0538ff ocfs2: sparse b-t... |
2514 |
|
328d5752e ocfs2: btree chan... |
2515 |
BUG_ON(i >= le16_to_cpu(root_el->l_next_free_rec)); |
dcd0538ff ocfs2: sparse b-t... |
2516 |
|
328d5752e ocfs2: btree chan... |
2517 2518 2519 2520 2521 2522 2523 2524 |
memset(&root_el->l_recs[i], 0, sizeof(struct ocfs2_extent_rec)); le16_add_cpu(&root_el->l_next_free_rec, -1); eb = (struct ocfs2_extent_block *)path_leaf_bh(left_path)->b_data; eb->h_next_leaf_blk = 0; ocfs2_journal_dirty(handle, root_bh); ocfs2_journal_dirty(handle, path_leaf_bh(left_path)); |
6641b0ce3 ocfs2: Pass ocfs2... |
2525 |
ocfs2_unlink_path(handle, et, dealloc, right_path, |
328d5752e ocfs2: btree chan... |
2526 2527 |
subtree_index + 1); } |
1e2dd63fe ocfs2: ocfs2_rota... |
2528 2529 |
static int ocfs2_rotate_subtree_left(handle_t *handle, struct ocfs2_extent_tree *et, |
328d5752e ocfs2: btree chan... |
2530 2531 2532 2533 |
struct ocfs2_path *left_path, struct ocfs2_path *right_path, int subtree_index, struct ocfs2_cached_dealloc_ctxt *dealloc, |
1e2dd63fe ocfs2: ocfs2_rota... |
2534 |
int *deleted) |
328d5752e ocfs2: btree chan... |
2535 2536 |
{ int ret, i, del_right_subtree = 0, right_has_empty = 0; |
e7d4cb6bc ocfs2: Abstract o... |
2537 |
struct buffer_head *root_bh, *et_root_bh = path_root_bh(right_path); |
328d5752e ocfs2: btree chan... |
2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 |
struct ocfs2_extent_list *right_leaf_el, *left_leaf_el; struct ocfs2_extent_block *eb; *deleted = 0; right_leaf_el = path_leaf_el(right_path); left_leaf_el = path_leaf_el(left_path); root_bh = left_path->p_node[subtree_index].bh; BUG_ON(root_bh != right_path->p_node[subtree_index].bh); if (!ocfs2_is_empty_extent(&left_leaf_el->l_recs[0])) return 0; |
dcd0538ff ocfs2: sparse b-t... |
2550 |
|
328d5752e ocfs2: btree chan... |
2551 2552 |
eb = (struct ocfs2_extent_block *)path_leaf_bh(right_path)->b_data; if (ocfs2_is_empty_extent(&right_leaf_el->l_recs[0])) { |
dcd0538ff ocfs2: sparse b-t... |
2553 |
/* |
328d5752e ocfs2: btree chan... |
2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 |
* It's legal for us to proceed if the right leaf is * the rightmost one and it has an empty extent. There * are two cases to handle - whether the leaf will be * empty after removal or not. If the leaf isn't empty * then just remove the empty extent up front. The * next block will handle empty leaves by flagging * them for unlink. * * Non rightmost leaves will throw -EAGAIN and the * caller can manually move the subtree and retry. |
dcd0538ff ocfs2: sparse b-t... |
2564 |
*/ |
dcd0538ff ocfs2: sparse b-t... |
2565 |
|
328d5752e ocfs2: btree chan... |
2566 2567 2568 2569 |
if (eb->h_next_leaf_blk != 0ULL) return -EAGAIN; if (le16_to_cpu(right_leaf_el->l_next_free_rec) > 1) { |
1e2dd63fe ocfs2: ocfs2_rota... |
2570 |
ret = ocfs2_journal_access_eb(handle, et->et_ci, |
13723d00e ocfs2: Use metada... |
2571 2572 |
path_leaf_bh(right_path), OCFS2_JOURNAL_ACCESS_WRITE); |
dcd0538ff ocfs2: sparse b-t... |
2573 2574 2575 2576 |
if (ret) { mlog_errno(ret); goto out; } |
328d5752e ocfs2: btree chan... |
2577 2578 2579 |
ocfs2_remove_empty_extent(right_leaf_el); } else right_has_empty = 1; |
dcd0538ff ocfs2: sparse b-t... |
2580 |
} |
328d5752e ocfs2: btree chan... |
2581 2582 2583 2584 2585 2586 |
if (eb->h_next_leaf_blk == 0ULL && le16_to_cpu(right_leaf_el->l_next_free_rec) == 1) { /* * We have to update i_last_eb_blk during the meta * data delete. */ |
d9a0a1f83 ocfs2: Store the ... |
2587 |
ret = ocfs2_et_root_journal_access(handle, et, |
13723d00e ocfs2: Use metada... |
2588 |
OCFS2_JOURNAL_ACCESS_WRITE); |
328d5752e ocfs2: btree chan... |
2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 |
if (ret) { mlog_errno(ret); goto out; } del_right_subtree = 1; } /* * Getting here with an empty extent in the right path implies * that it's the rightmost path and will be deleted. */ BUG_ON(right_has_empty && !del_right_subtree); |
1e2dd63fe ocfs2: ocfs2_rota... |
2602 |
ret = ocfs2_path_bh_journal_access(handle, et->et_ci, right_path, |
13723d00e ocfs2: Use metada... |
2603 |
subtree_index); |
328d5752e ocfs2: btree chan... |
2604 2605 2606 2607 2608 2609 |
if (ret) { mlog_errno(ret); goto out; } for(i = subtree_index + 1; i < path_num_items(right_path); i++) { |
1e2dd63fe ocfs2: ocfs2_rota... |
2610 |
ret = ocfs2_path_bh_journal_access(handle, et->et_ci, |
13723d00e ocfs2: Use metada... |
2611 |
right_path, i); |
328d5752e ocfs2: btree chan... |
2612 2613 2614 2615 |
if (ret) { mlog_errno(ret); goto out; } |
1e2dd63fe ocfs2: ocfs2_rota... |
2616 |
ret = ocfs2_path_bh_journal_access(handle, et->et_ci, |
13723d00e ocfs2: Use metada... |
2617 |
left_path, i); |
328d5752e ocfs2: btree chan... |
2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 |
if (ret) { mlog_errno(ret); goto out; } } if (!right_has_empty) { /* * Only do this if we're moving a real * record. Otherwise, the action is delayed until * after removal of the right path in which case we * can do a simple shift to remove the empty extent. */ ocfs2_rotate_leaf(left_leaf_el, &right_leaf_el->l_recs[0]); memset(&right_leaf_el->l_recs[0], 0, sizeof(struct ocfs2_extent_rec)); } if (eb->h_next_leaf_blk == 0ULL) { /* * Move recs over to get rid of empty extent, decrease * next_free. This is allowed to remove the last * extent in our leaf (setting l_next_free_rec to * zero) - the delete code below won't care. */ ocfs2_remove_empty_extent(right_leaf_el); } |
ec20cec7a ocfs2: Make ocfs2... |
2644 2645 |
ocfs2_journal_dirty(handle, path_leaf_bh(left_path)); ocfs2_journal_dirty(handle, path_leaf_bh(right_path)); |
328d5752e ocfs2: btree chan... |
2646 2647 |
if (del_right_subtree) { |
6641b0ce3 ocfs2: Pass ocfs2... |
2648 |
ocfs2_unlink_subtree(handle, et, left_path, right_path, |
328d5752e ocfs2: btree chan... |
2649 |
subtree_index, dealloc); |
964f14a0d ocfs2: clean up s... |
2650 |
ret = ocfs2_update_edge_lengths(handle, et, left_path); |
3c5e10683 ocfs2: Add extra ... |
2651 2652 2653 2654 |
if (ret) { mlog_errno(ret); goto out; } |
328d5752e ocfs2: btree chan... |
2655 2656 |
eb = (struct ocfs2_extent_block *)path_leaf_bh(left_path)->b_data; |
35dc0aa3c ocfs2: Prefix the... |
2657 |
ocfs2_et_set_last_eb_blk(et, le64_to_cpu(eb->h_blkno)); |
328d5752e ocfs2: btree chan... |
2658 2659 2660 2661 2662 2663 2664 2665 |
/* * Removal of the extent in the left leaf was skipped * above so we could delete the right path * 1st. */ if (right_has_empty) ocfs2_remove_empty_extent(left_leaf_el); |
ec20cec7a ocfs2: Make ocfs2... |
2666 |
ocfs2_journal_dirty(handle, et_root_bh); |
328d5752e ocfs2: btree chan... |
2667 2668 2669 |
*deleted = 1; } else |
4619c73e7 ocfs2: ocfs2_comp... |
2670 |
ocfs2_complete_edge_insert(handle, left_path, right_path, |
328d5752e ocfs2: btree chan... |
2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 |
subtree_index); out: return ret; } /* * Given a full path, determine what cpos value would return us a path * containing the leaf immediately to the right of the current one. * * Will return zero if the path passed in is already the rightmost path. * * This looks similar, but is subtly different to * ocfs2_find_cpos_for_left_leaf(). */ |
38a04e432 ocfs2: Find prope... |
2686 2687 |
int ocfs2_find_cpos_for_right_leaf(struct super_block *sb, struct ocfs2_path *path, u32 *cpos) |
328d5752e ocfs2: btree chan... |
2688 2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 |
{ int i, j, ret = 0; u64 blkno; struct ocfs2_extent_list *el; *cpos = 0; if (path->p_tree_depth == 0) return 0; blkno = path_leaf_bh(path)->b_blocknr; /* Start at the tree node just above the leaf and work our way up. */ i = path->p_tree_depth - 1; while (i >= 0) { int next_free; el = path->p_node[i].el; /* * Find the extent record just after the one in our * path. */ next_free = le16_to_cpu(el->l_next_free_rec); for(j = 0; j < le16_to_cpu(el->l_next_free_rec); j++) { if (le64_to_cpu(el->l_recs[j].e_blkno) == blkno) { if (j == (next_free - 1)) { if (i == 0) { /* * We've determined that the * path specified is already * the rightmost one - return a * cpos of zero. */ goto out; } /* * The rightmost record points to our * leaf - we need to travel up the * tree one level. */ goto next_node; } *cpos = le32_to_cpu(el->l_recs[j + 1].e_cpos); goto out; } } /* * If we got here, we never found a valid node where * the tree indicated one should be. */ |
7ecef14ab ocfs2: neaten do_... |
2741 2742 |
ocfs2_error(sb, "Invalid extent tree at extent block %llu ", |
328d5752e ocfs2: btree chan... |
2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 |
(unsigned long long)blkno); ret = -EROFS; goto out; next_node: blkno = path->p_node[i].bh->b_blocknr; i--; } out: return ret; } |
70f18c08b ocfs2: ocfs2_rota... |
2755 2756 |
static int ocfs2_rotate_rightmost_leaf_left(handle_t *handle, struct ocfs2_extent_tree *et, |
13723d00e ocfs2: Use metada... |
2757 |
struct ocfs2_path *path) |
328d5752e ocfs2: btree chan... |
2758 2759 |
{ int ret; |
13723d00e ocfs2: Use metada... |
2760 2761 |
struct buffer_head *bh = path_leaf_bh(path); struct ocfs2_extent_list *el = path_leaf_el(path); |
328d5752e ocfs2: btree chan... |
2762 2763 2764 |
if (!ocfs2_is_empty_extent(&el->l_recs[0])) return 0; |
70f18c08b ocfs2: ocfs2_rota... |
2765 |
ret = ocfs2_path_bh_journal_access(handle, et->et_ci, path, |
13723d00e ocfs2: Use metada... |
2766 |
path_num_items(path) - 1); |
328d5752e ocfs2: btree chan... |
2767 2768 2769 2770 2771 2772 |
if (ret) { mlog_errno(ret); goto out; } ocfs2_remove_empty_extent(el); |
ec20cec7a ocfs2: Make ocfs2... |
2773 |
ocfs2_journal_dirty(handle, bh); |
328d5752e ocfs2: btree chan... |
2774 2775 2776 2777 |
out: return ret; } |
e46f74dc3 ocfs2: __ocfs2_ro... |
2778 2779 2780 |
static int __ocfs2_rotate_tree_left(handle_t *handle, struct ocfs2_extent_tree *et, int orig_credits, |
328d5752e ocfs2: btree chan... |
2781 2782 |
struct ocfs2_path *path, struct ocfs2_cached_dealloc_ctxt *dealloc, |
e46f74dc3 ocfs2: __ocfs2_ro... |
2783 |
struct ocfs2_path **empty_extent_path) |
328d5752e ocfs2: btree chan... |
2784 2785 2786 2787 2788 |
{ int ret, subtree_root, deleted; u32 right_cpos; struct ocfs2_path *left_path = NULL; struct ocfs2_path *right_path = NULL; |
e46f74dc3 ocfs2: __ocfs2_ro... |
2789 |
struct super_block *sb = ocfs2_metadata_cache_get_super(et->et_ci); |
328d5752e ocfs2: btree chan... |
2790 |
|
099768b0c ocfs2: remove BUG... |
2791 2792 |
if (!ocfs2_is_empty_extent(&(path_leaf_el(path)->l_recs[0]))) return 0; |
328d5752e ocfs2: btree chan... |
2793 2794 |
*empty_extent_path = NULL; |
e46f74dc3 ocfs2: __ocfs2_ro... |
2795 |
ret = ocfs2_find_cpos_for_right_leaf(sb, path, &right_cpos); |
328d5752e ocfs2: btree chan... |
2796 2797 2798 2799 |
if (ret) { mlog_errno(ret); goto out; } |
ffdd7a546 ocfs2: Wrap up th... |
2800 |
left_path = ocfs2_new_path_from_path(path); |
328d5752e ocfs2: btree chan... |
2801 2802 2803 2804 2805 2806 2807 |
if (!left_path) { ret = -ENOMEM; mlog_errno(ret); goto out; } ocfs2_cp_path(left_path, path); |
ffdd7a546 ocfs2: Wrap up th... |
2808 |
right_path = ocfs2_new_path_from_path(path); |
328d5752e ocfs2: btree chan... |
2809 2810 2811 2812 2813 2814 2815 |
if (!right_path) { ret = -ENOMEM; mlog_errno(ret); goto out; } while (right_cpos) { |
facdb77f5 ocfs2: ocfs2_find... |
2816 |
ret = ocfs2_find_path(et->et_ci, right_path, right_cpos); |
328d5752e ocfs2: btree chan... |
2817 2818 2819 2820 |
if (ret) { mlog_errno(ret); goto out; } |
7dc028056 ocfs2: Pass ocfs2... |
2821 |
subtree_root = ocfs2_find_subtree_root(et, left_path, |
328d5752e ocfs2: btree chan... |
2822 |
right_path); |
a09d09b8f ocfs2: Remove mlo... |
2823 |
trace_ocfs2_rotate_subtree(subtree_root, |
328d5752e ocfs2: btree chan... |
2824 2825 2826 |
(unsigned long long) right_path->p_node[subtree_root].bh->b_blocknr, right_path->p_tree_depth); |
172159898 ocfs2: extend tra... |
2827 |
ret = ocfs2_extend_rotate_transaction(handle, 0, |
328d5752e ocfs2: btree chan... |
2828 2829 2830 2831 2832 |
orig_credits, left_path); if (ret) { mlog_errno(ret); goto out; } |
e8aed3450 ocfs2: Re-journal... |
2833 2834 2835 2836 |
/* * Caller might still want to make changes to the * tree root, so re-add it to the journal here. */ |
e46f74dc3 ocfs2: __ocfs2_ro... |
2837 |
ret = ocfs2_path_bh_journal_access(handle, et->et_ci, |
13723d00e ocfs2: Use metada... |
2838 |
left_path, 0); |
e8aed3450 ocfs2: Re-journal... |
2839 2840 2841 2842 |
if (ret) { mlog_errno(ret); goto out; } |
1e2dd63fe ocfs2: ocfs2_rota... |
2843 |
ret = ocfs2_rotate_subtree_left(handle, et, left_path, |
328d5752e ocfs2: btree chan... |
2844 |
right_path, subtree_root, |
1e2dd63fe ocfs2: ocfs2_rota... |
2845 |
dealloc, &deleted); |
328d5752e ocfs2: btree chan... |
2846 2847 2848 2849 2850 2851 2852 2853 2854 2855 2856 2857 2858 2859 2860 2861 2862 2863 2864 2865 2866 2867 2868 2869 2870 |
if (ret == -EAGAIN) { /* * The rotation has to temporarily stop due to * the right subtree having an empty * extent. Pass it back to the caller for a * fixup. */ *empty_extent_path = right_path; right_path = NULL; goto out; } if (ret) { mlog_errno(ret); goto out; } /* * The subtree rotate might have removed records on * the rightmost edge. If so, then rotation is * complete. */ if (deleted) break; ocfs2_mv_path(left_path, right_path); |
e46f74dc3 ocfs2: __ocfs2_ro... |
2871 |
ret = ocfs2_find_cpos_for_right_leaf(sb, left_path, |
328d5752e ocfs2: btree chan... |
2872 2873 2874 2875 2876 2877 2878 2879 2880 2881 2882 2883 2884 |
&right_cpos); if (ret) { mlog_errno(ret); goto out; } } out: ocfs2_free_path(right_path); ocfs2_free_path(left_path); return ret; } |
70f18c08b ocfs2: ocfs2_rota... |
2885 2886 |
static int ocfs2_remove_rightmost_path(handle_t *handle, struct ocfs2_extent_tree *et, |
e7d4cb6bc ocfs2: Abstract o... |
2887 |
struct ocfs2_path *path, |
70f18c08b ocfs2: ocfs2_rota... |
2888 |
struct ocfs2_cached_dealloc_ctxt *dealloc) |
328d5752e ocfs2: btree chan... |
2889 2890 2891 2892 |
{ int ret, subtree_index; u32 cpos; struct ocfs2_path *left_path = NULL; |
328d5752e ocfs2: btree chan... |
2893 2894 |
struct ocfs2_extent_block *eb; struct ocfs2_extent_list *el; |
6136ca5f5 ocfs2: Drop struc... |
2895 |
ret = ocfs2_et_sanity_check(et); |
e7d4cb6bc ocfs2: Abstract o... |
2896 2897 |
if (ret) goto out; |
328d5752e ocfs2: btree chan... |
2898 |
|
d9a0a1f83 ocfs2: Store the ... |
2899 |
ret = ocfs2_journal_access_path(et->et_ci, handle, path); |
328d5752e ocfs2: btree chan... |
2900 2901 2902 2903 |
if (ret) { mlog_errno(ret); goto out; } |
3d03a305d ocfs2: Pass ocfs2... |
2904 2905 |
ret = ocfs2_find_cpos_for_left_leaf(ocfs2_metadata_cache_get_super(et->et_ci), path, &cpos); |
328d5752e ocfs2: btree chan... |
2906 2907 2908 2909 2910 2911 2912 2913 2914 2915 |
if (ret) { mlog_errno(ret); goto out; } if (cpos) { /* * We have a path to the left of this one - it needs * an update too. */ |
ffdd7a546 ocfs2: Wrap up th... |
2916 |
left_path = ocfs2_new_path_from_path(path); |
328d5752e ocfs2: btree chan... |
2917 2918 2919 2920 2921 |
if (!left_path) { ret = -ENOMEM; mlog_errno(ret); goto out; } |
facdb77f5 ocfs2: ocfs2_find... |
2922 |
ret = ocfs2_find_path(et->et_ci, left_path, cpos); |
328d5752e ocfs2: btree chan... |
2923 2924 2925 2926 |
if (ret) { mlog_errno(ret); goto out; } |
d9a0a1f83 ocfs2: Store the ... |
2927 |
ret = ocfs2_journal_access_path(et->et_ci, handle, left_path); |
328d5752e ocfs2: btree chan... |
2928 2929 2930 2931 |
if (ret) { mlog_errno(ret); goto out; } |
7dc028056 ocfs2: Pass ocfs2... |
2932 |
subtree_index = ocfs2_find_subtree_root(et, left_path, path); |
328d5752e ocfs2: btree chan... |
2933 |
|
6641b0ce3 ocfs2: Pass ocfs2... |
2934 |
ocfs2_unlink_subtree(handle, et, left_path, path, |
328d5752e ocfs2: btree chan... |
2935 |
subtree_index, dealloc); |
964f14a0d ocfs2: clean up s... |
2936 |
ret = ocfs2_update_edge_lengths(handle, et, left_path); |
3c5e10683 ocfs2: Add extra ... |
2937 2938 2939 2940 |
if (ret) { mlog_errno(ret); goto out; } |
328d5752e ocfs2: btree chan... |
2941 2942 |
eb = (struct ocfs2_extent_block *)path_leaf_bh(left_path)->b_data; |
35dc0aa3c ocfs2: Prefix the... |
2943 |
ocfs2_et_set_last_eb_blk(et, le64_to_cpu(eb->h_blkno)); |
328d5752e ocfs2: btree chan... |
2944 2945 2946 2947 2948 |
} else { /* * 'path' is also the leftmost path which * means it must be the only one. This gets * handled differently because we want to |
70f18c08b ocfs2: ocfs2_rota... |
2949 |
* revert the root back to having extents |
328d5752e ocfs2: btree chan... |
2950 2951 |
* in-line. */ |
6641b0ce3 ocfs2: Pass ocfs2... |
2952 |
ocfs2_unlink_path(handle, et, dealloc, path, 1); |
328d5752e ocfs2: btree chan... |
2953 |
|
ce1d9ea62 ocfs2: Prefix the... |
2954 |
el = et->et_root_el; |
328d5752e ocfs2: btree chan... |
2955 2956 2957 |
el->l_tree_depth = 0; el->l_next_free_rec = 0; memset(&el->l_recs[0], 0, sizeof(struct ocfs2_extent_rec)); |
35dc0aa3c ocfs2: Prefix the... |
2958 |
ocfs2_et_set_last_eb_blk(et, 0); |
328d5752e ocfs2: btree chan... |
2959 2960 2961 2962 2963 2964 2965 2966 |
} ocfs2_journal_dirty(handle, path_root_bh(path)); out: ocfs2_free_path(left_path); return ret; } |
d0c97d52f ocfs2: do not set... |
2967 2968 2969 2970 2971 2972 2973 2974 2975 2976 2977 2978 2979 2980 2981 2982 2983 2984 2985 2986 2987 2988 2989 |
static int ocfs2_remove_rightmost_empty_extent(struct ocfs2_super *osb, struct ocfs2_extent_tree *et, struct ocfs2_path *path, struct ocfs2_cached_dealloc_ctxt *dealloc) { handle_t *handle; int ret; int credits = path->p_tree_depth * 2 + 1; handle = ocfs2_start_trans(osb, credits); if (IS_ERR(handle)) { ret = PTR_ERR(handle); mlog_errno(ret); return ret; } ret = ocfs2_remove_rightmost_path(handle, et, path, dealloc); if (ret) mlog_errno(ret); ocfs2_commit_trans(osb, handle); return ret; } |
328d5752e ocfs2: btree chan... |
2990 2991 2992 2993 2994 2995 2996 2997 2998 2999 3000 3001 3002 3003 3004 3005 |
/* * Left rotation of btree records. * * In many ways, this is (unsurprisingly) the opposite of right * rotation. We start at some non-rightmost path containing an empty * extent in the leaf block. The code works its way to the rightmost * path by rotating records to the left in every subtree. * * This is used by any code which reduces the number of extent records * in a leaf. After removal, an empty record should be placed in the * leftmost list position. * * This won't handle a length update of the rightmost path records if * the rightmost tree leaf record is removed so the caller is * responsible for detecting and correcting that. */ |
70f18c08b ocfs2: ocfs2_rota... |
3006 3007 |
static int ocfs2_rotate_tree_left(handle_t *handle, struct ocfs2_extent_tree *et, |
328d5752e ocfs2: btree chan... |
3008 |
struct ocfs2_path *path, |
70f18c08b ocfs2: ocfs2_rota... |
3009 |
struct ocfs2_cached_dealloc_ctxt *dealloc) |
328d5752e ocfs2: btree chan... |
3010 3011 3012 3013 3014 3015 3016 3017 3018 3019 3020 3021 3022 |
{ int ret, orig_credits = handle->h_buffer_credits; struct ocfs2_path *tmp_path = NULL, *restart_path = NULL; struct ocfs2_extent_block *eb; struct ocfs2_extent_list *el; el = path_leaf_el(path); if (!ocfs2_is_empty_extent(&el->l_recs[0])) return 0; if (path->p_tree_depth == 0) { rightmost_no_delete: /* |
e7d4cb6bc ocfs2: Abstract o... |
3023 |
* Inline extents. This is trivially handled, so do |
328d5752e ocfs2: btree chan... |
3024 3025 |
* it up front. */ |
70f18c08b ocfs2: ocfs2_rota... |
3026 |
ret = ocfs2_rotate_rightmost_leaf_left(handle, et, path); |
328d5752e ocfs2: btree chan... |
3027 3028 3029 3030 3031 3032 3033 3034 3035 3036 3037 3038 3039 3040 3041 |
if (ret) mlog_errno(ret); goto out; } /* * Handle rightmost branch now. There's several cases: * 1) simple rotation leaving records in there. That's trivial. * 2) rotation requiring a branch delete - there's no more * records left. Two cases of this: * a) There are branches to the left. * b) This is also the leftmost (the only) branch. * * 1) is handled via ocfs2_rotate_rightmost_leaf_left() * 2a) we need the left branch so that we can update it with the unlink |
70f18c08b ocfs2: ocfs2_rota... |
3042 |
* 2b) we need to bring the root back to inline extents. |
328d5752e ocfs2: btree chan... |
3043 3044 3045 3046 3047 3048 3049 3050 3051 3052 3053 3054 3055 3056 3057 |
*/ eb = (struct ocfs2_extent_block *)path_leaf_bh(path)->b_data; el = &eb->h_list; if (eb->h_next_leaf_blk == 0) { /* * This gets a bit tricky if we're going to delete the * rightmost path. Get the other cases out of the way * 1st. */ if (le16_to_cpu(el->l_next_free_rec) > 1) goto rightmost_no_delete; if (le16_to_cpu(el->l_next_free_rec) == 0) { ret = -EIO; |
70f18c08b ocfs2: ocfs2_rota... |
3058 |
ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci), |
7ecef14ab ocfs2: neaten do_... |
3059 3060 |
"Owner %llu has empty extent block at %llu ", |
70f18c08b ocfs2: ocfs2_rota... |
3061 |
(unsigned long long)ocfs2_metadata_cache_owner(et->et_ci), |
328d5752e ocfs2: btree chan... |
3062 3063 3064 3065 3066 3067 3068 3069 3070 3071 3072 3073 |
(unsigned long long)le64_to_cpu(eb->h_blkno)); goto out; } /* * XXX: The caller can not trust "path" any more after * this as it will have been deleted. What do we do? * * In theory the rotate-for-merge code will never get * here because it'll always ask for a rotate in a * nonempty list. */ |
70f18c08b ocfs2: ocfs2_rota... |
3074 3075 |
ret = ocfs2_remove_rightmost_path(handle, et, path, dealloc); |
328d5752e ocfs2: btree chan... |
3076 3077 3078 3079 3080 3081 3082 3083 3084 3085 |
if (ret) mlog_errno(ret); goto out; } /* * Now we can loop, remembering the path we get from -EAGAIN * and restarting from there. */ try_rotate: |
e46f74dc3 ocfs2: __ocfs2_ro... |
3086 3087 |
ret = __ocfs2_rotate_tree_left(handle, et, orig_credits, path, dealloc, &restart_path); |
328d5752e ocfs2: btree chan... |
3088 3089 3090 3091 3092 3093 3094 3095 |
if (ret && ret != -EAGAIN) { mlog_errno(ret); goto out; } while (ret == -EAGAIN) { tmp_path = restart_path; restart_path = NULL; |
e46f74dc3 ocfs2: __ocfs2_ro... |
3096 |
ret = __ocfs2_rotate_tree_left(handle, et, orig_credits, |
328d5752e ocfs2: btree chan... |
3097 |
tmp_path, dealloc, |
e46f74dc3 ocfs2: __ocfs2_ro... |
3098 |
&restart_path); |
328d5752e ocfs2: btree chan... |
3099 3100 3101 3102 3103 3104 3105 3106 3107 3108 3109 3110 3111 3112 3113 3114 3115 3116 3117 3118 3119 3120 3121 3122 3123 3124 3125 3126 3127 3128 3129 3130 3131 3132 3133 3134 3135 3136 3137 3138 3139 3140 3141 3142 3143 3144 3145 3146 3147 |
if (ret && ret != -EAGAIN) { mlog_errno(ret); goto out; } ocfs2_free_path(tmp_path); tmp_path = NULL; if (ret == 0) goto try_rotate; } out: ocfs2_free_path(tmp_path); ocfs2_free_path(restart_path); return ret; } static void ocfs2_cleanup_merge(struct ocfs2_extent_list *el, int index) { struct ocfs2_extent_rec *rec = &el->l_recs[index]; unsigned int size; if (rec->e_leaf_clusters == 0) { /* * We consumed all of the merged-from record. An empty * extent cannot exist anywhere but the 1st array * position, so move things over if the merged-from * record doesn't occupy that position. * * This creates a new empty extent so the caller * should be smart enough to have removed any existing * ones. */ if (index > 0) { BUG_ON(ocfs2_is_empty_extent(&el->l_recs[0])); size = index * sizeof(struct ocfs2_extent_rec); memmove(&el->l_recs[1], &el->l_recs[0], size); } /* * Always memset - the caller doesn't check whether it * created an empty extent, so there could be junk in * the other fields. */ memset(&el->l_recs[0], 0, sizeof(struct ocfs2_extent_rec)); } } |
4fe82c312 ocfs2: ocfs2_merg... |
3148 |
static int ocfs2_get_right_path(struct ocfs2_extent_tree *et, |
677b97528 ocfs2: Add suppor... |
3149 3150 3151 3152 3153 3154 3155 3156 3157 3158 3159 3160 3161 3162 3163 |
struct ocfs2_path *left_path, struct ocfs2_path **ret_right_path) { int ret; u32 right_cpos; struct ocfs2_path *right_path = NULL; struct ocfs2_extent_list *left_el; *ret_right_path = NULL; /* This function shouldn't be called for non-trees. */ BUG_ON(left_path->p_tree_depth == 0); left_el = path_leaf_el(left_path); BUG_ON(left_el->l_next_free_rec != left_el->l_count); |
4fe82c312 ocfs2: ocfs2_merg... |
3164 3165 |
ret = ocfs2_find_cpos_for_right_leaf(ocfs2_metadata_cache_get_super(et->et_ci), left_path, &right_cpos); |
677b97528 ocfs2: Add suppor... |
3166 3167 3168 3169 3170 3171 3172 |
if (ret) { mlog_errno(ret); goto out; } /* This function shouldn't be called for the rightmost leaf. */ BUG_ON(right_cpos == 0); |
ffdd7a546 ocfs2: Wrap up th... |
3173 |
right_path = ocfs2_new_path_from_path(left_path); |
677b97528 ocfs2: Add suppor... |
3174 3175 3176 3177 3178 |
if (!right_path) { ret = -ENOMEM; mlog_errno(ret); goto out; } |
4fe82c312 ocfs2: ocfs2_merg... |
3179 |
ret = ocfs2_find_path(et->et_ci, right_path, right_cpos); |
677b97528 ocfs2: Add suppor... |
3180 3181 3182 3183 3184 3185 3186 3187 3188 3189 3190 |
if (ret) { mlog_errno(ret); goto out; } *ret_right_path = right_path; out: if (ret) ocfs2_free_path(right_path); return ret; } |
328d5752e ocfs2: btree chan... |
3191 3192 |
/* * Remove split_rec clusters from the record at index and merge them |
677b97528 ocfs2: Add suppor... |
3193 3194 3195 3196 |
* onto the beginning of the record "next" to it. * For index < l_count - 1, the next means the extent rec at index + 1. * For index == l_count - 1, the "next" means the 1st extent rec of the * next extent block. |
328d5752e ocfs2: btree chan... |
3197 |
*/ |
4fe82c312 ocfs2: ocfs2_merg... |
3198 |
static int ocfs2_merge_rec_right(struct ocfs2_path *left_path, |
677b97528 ocfs2: Add suppor... |
3199 |
handle_t *handle, |
7dc028056 ocfs2: Pass ocfs2... |
3200 |
struct ocfs2_extent_tree *et, |
677b97528 ocfs2: Add suppor... |
3201 3202 |
struct ocfs2_extent_rec *split_rec, int index) |
328d5752e ocfs2: btree chan... |
3203 |
{ |
677b97528 ocfs2: Add suppor... |
3204 |
int ret, next_free, i; |
328d5752e ocfs2: btree chan... |
3205 3206 3207 |
unsigned int split_clusters = le16_to_cpu(split_rec->e_leaf_clusters); struct ocfs2_extent_rec *left_rec; struct ocfs2_extent_rec *right_rec; |
677b97528 ocfs2: Add suppor... |
3208 3209 3210 3211 3212 3213 |
struct ocfs2_extent_list *right_el; struct ocfs2_path *right_path = NULL; int subtree_index = 0; struct ocfs2_extent_list *el = path_leaf_el(left_path); struct buffer_head *bh = path_leaf_bh(left_path); struct buffer_head *root_bh = NULL; |
328d5752e ocfs2: btree chan... |
3214 3215 |
BUG_ON(index >= le16_to_cpu(el->l_next_free_rec)); |
328d5752e ocfs2: btree chan... |
3216 |
left_rec = &el->l_recs[index]; |
677b97528 ocfs2: Add suppor... |
3217 |
|
9d8df6aa9 ocfs2 endianness ... |
3218 |
if (index == le16_to_cpu(el->l_next_free_rec) - 1 && |
677b97528 ocfs2: Add suppor... |
3219 3220 |
le16_to_cpu(el->l_next_free_rec) == le16_to_cpu(el->l_count)) { /* we meet with a cross extent block merge. */ |
4fe82c312 ocfs2: ocfs2_merg... |
3221 |
ret = ocfs2_get_right_path(et, left_path, &right_path); |
677b97528 ocfs2: Add suppor... |
3222 3223 |
if (ret) { mlog_errno(ret); |
629a3b5f0 ocfs2: one functi... |
3224 |
return ret; |
677b97528 ocfs2: Add suppor... |
3225 3226 3227 3228 3229 3230 3231 |
} right_el = path_leaf_el(right_path); next_free = le16_to_cpu(right_el->l_next_free_rec); BUG_ON(next_free <= 0); right_rec = &right_el->l_recs[0]; if (ocfs2_is_empty_extent(right_rec)) { |
9d8df6aa9 ocfs2 endianness ... |
3232 |
BUG_ON(next_free <= 1); |
677b97528 ocfs2: Add suppor... |
3233 3234 3235 3236 3237 3238 |
right_rec = &right_el->l_recs[1]; } BUG_ON(le32_to_cpu(left_rec->e_cpos) + le16_to_cpu(left_rec->e_leaf_clusters) != le32_to_cpu(right_rec->e_cpos)); |
7dc028056 ocfs2: Pass ocfs2... |
3239 3240 |
subtree_index = ocfs2_find_subtree_root(et, left_path, right_path); |
677b97528 ocfs2: Add suppor... |
3241 3242 3243 3244 3245 3246 3247 3248 3249 3250 3251 |
ret = ocfs2_extend_rotate_transaction(handle, subtree_index, handle->h_buffer_credits, right_path); if (ret) { mlog_errno(ret); goto out; } root_bh = left_path->p_node[subtree_index].bh; BUG_ON(root_bh != right_path->p_node[subtree_index].bh); |
7dc028056 ocfs2: Pass ocfs2... |
3252 |
ret = ocfs2_path_bh_journal_access(handle, et->et_ci, right_path, |
13723d00e ocfs2: Use metada... |
3253 |
subtree_index); |
677b97528 ocfs2: Add suppor... |
3254 3255 3256 3257 3258 3259 3260 |
if (ret) { mlog_errno(ret); goto out; } for (i = subtree_index + 1; i < path_num_items(right_path); i++) { |
7dc028056 ocfs2: Pass ocfs2... |
3261 |
ret = ocfs2_path_bh_journal_access(handle, et->et_ci, |
13723d00e ocfs2: Use metada... |
3262 |
right_path, i); |
677b97528 ocfs2: Add suppor... |
3263 3264 3265 3266 |
if (ret) { mlog_errno(ret); goto out; } |
7dc028056 ocfs2: Pass ocfs2... |
3267 |
ret = ocfs2_path_bh_journal_access(handle, et->et_ci, |
13723d00e ocfs2: Use metada... |
3268 |
left_path, i); |
677b97528 ocfs2: Add suppor... |
3269 3270 3271 3272 3273 3274 3275 3276 3277 3278 |
if (ret) { mlog_errno(ret); goto out; } } } else { BUG_ON(index == le16_to_cpu(el->l_next_free_rec) - 1); right_rec = &el->l_recs[index + 1]; } |
328d5752e ocfs2: btree chan... |
3279 |
|
7dc028056 ocfs2: Pass ocfs2... |
3280 |
ret = ocfs2_path_bh_journal_access(handle, et->et_ci, left_path, |
13723d00e ocfs2: Use metada... |
3281 |
path_num_items(left_path) - 1); |
328d5752e ocfs2: btree chan... |
3282 3283 3284 3285 3286 3287 3288 3289 3290 |
if (ret) { mlog_errno(ret); goto out; } le16_add_cpu(&left_rec->e_leaf_clusters, -split_clusters); le32_add_cpu(&right_rec->e_cpos, -split_clusters); le64_add_cpu(&right_rec->e_blkno, |
7dc028056 ocfs2: Pass ocfs2... |
3291 3292 |
-ocfs2_clusters_to_blocks(ocfs2_metadata_cache_get_super(et->et_ci), split_clusters)); |
328d5752e ocfs2: btree chan... |
3293 3294 3295 |
le16_add_cpu(&right_rec->e_leaf_clusters, split_clusters); ocfs2_cleanup_merge(el, index); |
ec20cec7a ocfs2: Make ocfs2... |
3296 |
ocfs2_journal_dirty(handle, bh); |
677b97528 ocfs2: Add suppor... |
3297 |
if (right_path) { |
ec20cec7a ocfs2: Make ocfs2... |
3298 |
ocfs2_journal_dirty(handle, path_leaf_bh(right_path)); |
4619c73e7 ocfs2: ocfs2_comp... |
3299 3300 |
ocfs2_complete_edge_insert(handle, left_path, right_path, subtree_index); |
677b97528 ocfs2: Add suppor... |
3301 3302 |
} out: |
fd90d4dfb ocfs2: delete unn... |
3303 |
ocfs2_free_path(right_path); |
677b97528 ocfs2: Add suppor... |
3304 3305 |
return ret; } |
4fe82c312 ocfs2: ocfs2_merg... |
3306 |
static int ocfs2_get_left_path(struct ocfs2_extent_tree *et, |
677b97528 ocfs2: Add suppor... |
3307 3308 3309 3310 3311 3312 3313 3314 3315 3316 3317 |
struct ocfs2_path *right_path, struct ocfs2_path **ret_left_path) { int ret; u32 left_cpos; struct ocfs2_path *left_path = NULL; *ret_left_path = NULL; /* This function shouldn't be called for non-trees. */ BUG_ON(right_path->p_tree_depth == 0); |
4fe82c312 ocfs2: ocfs2_merg... |
3318 |
ret = ocfs2_find_cpos_for_left_leaf(ocfs2_metadata_cache_get_super(et->et_ci), |
677b97528 ocfs2: Add suppor... |
3319 3320 3321 3322 3323 3324 3325 3326 |
right_path, &left_cpos); if (ret) { mlog_errno(ret); goto out; } /* This function shouldn't be called for the leftmost leaf. */ BUG_ON(left_cpos == 0); |
ffdd7a546 ocfs2: Wrap up th... |
3327 |
left_path = ocfs2_new_path_from_path(right_path); |
677b97528 ocfs2: Add suppor... |
3328 3329 3330 3331 3332 |
if (!left_path) { ret = -ENOMEM; mlog_errno(ret); goto out; } |
4fe82c312 ocfs2: ocfs2_merg... |
3333 |
ret = ocfs2_find_path(et->et_ci, left_path, left_cpos); |
677b97528 ocfs2: Add suppor... |
3334 3335 3336 3337 3338 3339 |
if (ret) { mlog_errno(ret); goto out; } *ret_left_path = left_path; |
328d5752e ocfs2: btree chan... |
3340 |
out: |
677b97528 ocfs2: Add suppor... |
3341 3342 |
if (ret) ocfs2_free_path(left_path); |
328d5752e ocfs2: btree chan... |
3343 3344 3345 3346 3347 |
return ret; } /* * Remove split_rec clusters from the record at index and merge them |
677b97528 ocfs2: Add suppor... |
3348 3349 3350 3351 3352 3353 3354 |
* onto the tail of the record "before" it. * For index > 0, the "before" means the extent rec at index - 1. * * For index == 0, the "before" means the last record of the previous * extent block. And there is also a situation that we may need to * remove the rightmost leaf extent block in the right_path and change * the right path to indicate the new rightmost path. |
328d5752e ocfs2: btree chan... |
3355 |
*/ |
4fe82c312 ocfs2: ocfs2_merg... |
3356 |
static int ocfs2_merge_rec_left(struct ocfs2_path *right_path, |
328d5752e ocfs2: btree chan... |
3357 |
handle_t *handle, |
4fe82c312 ocfs2: ocfs2_merg... |
3358 |
struct ocfs2_extent_tree *et, |
328d5752e ocfs2: btree chan... |
3359 |
struct ocfs2_extent_rec *split_rec, |
677b97528 ocfs2: Add suppor... |
3360 3361 |
struct ocfs2_cached_dealloc_ctxt *dealloc, int index) |
328d5752e ocfs2: btree chan... |
3362 |
{ |
677b97528 ocfs2: Add suppor... |
3363 |
int ret, i, subtree_index = 0, has_empty_extent = 0; |
328d5752e ocfs2: btree chan... |
3364 3365 3366 |
unsigned int split_clusters = le16_to_cpu(split_rec->e_leaf_clusters); struct ocfs2_extent_rec *left_rec; struct ocfs2_extent_rec *right_rec; |
677b97528 ocfs2: Add suppor... |
3367 3368 3369 3370 3371 |
struct ocfs2_extent_list *el = path_leaf_el(right_path); struct buffer_head *bh = path_leaf_bh(right_path); struct buffer_head *root_bh = NULL; struct ocfs2_path *left_path = NULL; struct ocfs2_extent_list *left_el; |
328d5752e ocfs2: btree chan... |
3372 |
|
677b97528 ocfs2: Add suppor... |
3373 |
BUG_ON(index < 0); |
328d5752e ocfs2: btree chan... |
3374 |
|
328d5752e ocfs2: btree chan... |
3375 |
right_rec = &el->l_recs[index]; |
677b97528 ocfs2: Add suppor... |
3376 3377 |
if (index == 0) { /* we meet with a cross extent block merge. */ |
4fe82c312 ocfs2: ocfs2_merg... |
3378 |
ret = ocfs2_get_left_path(et, right_path, &left_path); |
677b97528 ocfs2: Add suppor... |
3379 3380 |
if (ret) { mlog_errno(ret); |
992ef6e79 ocfs2: one functi... |
3381 |
return ret; |
677b97528 ocfs2: Add suppor... |
3382 3383 3384 3385 3386 3387 3388 3389 3390 3391 3392 |
} left_el = path_leaf_el(left_path); BUG_ON(le16_to_cpu(left_el->l_next_free_rec) != le16_to_cpu(left_el->l_count)); left_rec = &left_el->l_recs[ le16_to_cpu(left_el->l_next_free_rec) - 1]; BUG_ON(le32_to_cpu(left_rec->e_cpos) + le16_to_cpu(left_rec->e_leaf_clusters) != le32_to_cpu(split_rec->e_cpos)); |
7dc028056 ocfs2: Pass ocfs2... |
3393 3394 |
subtree_index = ocfs2_find_subtree_root(et, left_path, right_path); |
677b97528 ocfs2: Add suppor... |
3395 3396 3397 3398 3399 3400 3401 3402 3403 3404 3405 |
ret = ocfs2_extend_rotate_transaction(handle, subtree_index, handle->h_buffer_credits, left_path); if (ret) { mlog_errno(ret); goto out; } root_bh = left_path->p_node[subtree_index].bh; BUG_ON(root_bh != right_path->p_node[subtree_index].bh); |
4fe82c312 ocfs2: ocfs2_merg... |
3406 |
ret = ocfs2_path_bh_journal_access(handle, et->et_ci, right_path, |
13723d00e ocfs2: Use metada... |
3407 |
subtree_index); |
677b97528 ocfs2: Add suppor... |
3408 3409 3410 3411 3412 3413 3414 |
if (ret) { mlog_errno(ret); goto out; } for (i = subtree_index + 1; i < path_num_items(right_path); i++) { |
4fe82c312 ocfs2: ocfs2_merg... |
3415 |
ret = ocfs2_path_bh_journal_access(handle, et->et_ci, |
13723d00e ocfs2: Use metada... |
3416 |
right_path, i); |
677b97528 ocfs2: Add suppor... |
3417 3418 3419 3420 |
if (ret) { mlog_errno(ret); goto out; } |
4fe82c312 ocfs2: ocfs2_merg... |
3421 |
ret = ocfs2_path_bh_journal_access(handle, et->et_ci, |
13723d00e ocfs2: Use metada... |
3422 |
left_path, i); |
677b97528 ocfs2: Add suppor... |
3423 3424 3425 3426 3427 3428 3429 3430 3431 3432 |
if (ret) { mlog_errno(ret); goto out; } } } else { left_rec = &el->l_recs[index - 1]; if (ocfs2_is_empty_extent(&el->l_recs[0])) has_empty_extent = 1; } |
328d5752e ocfs2: btree chan... |
3433 |
|
4fe82c312 ocfs2: ocfs2_merg... |
3434 |
ret = ocfs2_path_bh_journal_access(handle, et->et_ci, right_path, |
9047beabb ocfs2: Access the... |
3435 |
path_num_items(right_path) - 1); |
328d5752e ocfs2: btree chan... |
3436 3437 3438 3439 3440 3441 3442 3443 3444 3445 3446 3447 |
if (ret) { mlog_errno(ret); goto out; } if (has_empty_extent && index == 1) { /* * The easy case - we can just plop the record right in. */ *left_rec = *split_rec; has_empty_extent = 0; |
677b97528 ocfs2: Add suppor... |
3448 |
} else |
328d5752e ocfs2: btree chan... |
3449 |
le16_add_cpu(&left_rec->e_leaf_clusters, split_clusters); |
328d5752e ocfs2: btree chan... |
3450 3451 3452 |
le32_add_cpu(&right_rec->e_cpos, split_clusters); le64_add_cpu(&right_rec->e_blkno, |
4fe82c312 ocfs2: ocfs2_merg... |
3453 3454 |
ocfs2_clusters_to_blocks(ocfs2_metadata_cache_get_super(et->et_ci), split_clusters)); |
328d5752e ocfs2: btree chan... |
3455 3456 3457 |
le16_add_cpu(&right_rec->e_leaf_clusters, -split_clusters); ocfs2_cleanup_merge(el, index); |
ec20cec7a ocfs2: Make ocfs2... |
3458 |
ocfs2_journal_dirty(handle, bh); |
677b97528 ocfs2: Add suppor... |
3459 |
if (left_path) { |
ec20cec7a ocfs2: Make ocfs2... |
3460 |
ocfs2_journal_dirty(handle, path_leaf_bh(left_path)); |
677b97528 ocfs2: Add suppor... |
3461 3462 3463 3464 3465 3466 3467 3468 |
/* * In the situation that the right_rec is empty and the extent * block is empty also, ocfs2_complete_edge_insert can't handle * it and we need to delete the right extent block. */ if (le16_to_cpu(right_rec->e_leaf_clusters) == 0 && le16_to_cpu(el->l_next_free_rec) == 1) { |
172159898 ocfs2: extend tra... |
3469 3470 3471 3472 3473 3474 3475 3476 |
/* extend credit for ocfs2_remove_rightmost_path */ ret = ocfs2_extend_rotate_transaction(handle, 0, handle->h_buffer_credits, right_path); if (ret) { mlog_errno(ret); goto out; } |
677b97528 ocfs2: Add suppor... |
3477 |
|
70f18c08b ocfs2: ocfs2_rota... |
3478 |
ret = ocfs2_remove_rightmost_path(handle, et, |
e7d4cb6bc ocfs2: Abstract o... |
3479 |
right_path, |
70f18c08b ocfs2: ocfs2_rota... |
3480 |
dealloc); |
677b97528 ocfs2: Add suppor... |
3481 3482 3483 3484 3485 3486 3487 3488 3489 3490 3491 |
if (ret) { mlog_errno(ret); goto out; } /* Now the rightmost extent block has been deleted. * So we use the new rightmost path. */ ocfs2_mv_path(right_path, left_path); left_path = NULL; } else |
4619c73e7 ocfs2: ocfs2_comp... |
3492 |
ocfs2_complete_edge_insert(handle, left_path, |
677b97528 ocfs2: Add suppor... |
3493 3494 |
right_path, subtree_index); } |
328d5752e ocfs2: btree chan... |
3495 |
out: |
fd90d4dfb ocfs2: delete unn... |
3496 |
ocfs2_free_path(left_path); |
328d5752e ocfs2: btree chan... |
3497 3498 |
return ret; } |
c495dd24a ocfs2: ocfs2_try_... |
3499 3500 |
static int ocfs2_try_to_merge_extent(handle_t *handle, struct ocfs2_extent_tree *et, |
677b97528 ocfs2: Add suppor... |
3501 |
struct ocfs2_path *path, |
328d5752e ocfs2: btree chan... |
3502 3503 3504 |
int split_index, struct ocfs2_extent_rec *split_rec, struct ocfs2_cached_dealloc_ctxt *dealloc, |
c495dd24a ocfs2: ocfs2_try_... |
3505 |
struct ocfs2_merge_ctxt *ctxt) |
328d5752e ocfs2: btree chan... |
3506 |
{ |
518d7269f ocfs2: remove unu... |
3507 |
int ret = 0; |
677b97528 ocfs2: Add suppor... |
3508 |
struct ocfs2_extent_list *el = path_leaf_el(path); |
328d5752e ocfs2: btree chan... |
3509 3510 3511 |
struct ocfs2_extent_rec *rec = &el->l_recs[split_index]; BUG_ON(ctxt->c_contig_type == CONTIG_NONE); |
518d7269f ocfs2: remove unu... |
3512 |
if (ctxt->c_split_covers_rec && ctxt->c_has_empty_extent) { |
172159898 ocfs2: extend tra... |
3513 3514 3515 3516 3517 3518 3519 3520 |
/* extend credit for ocfs2_remove_rightmost_path */ ret = ocfs2_extend_rotate_transaction(handle, 0, handle->h_buffer_credits, path); if (ret) { mlog_errno(ret); goto out; } |
518d7269f ocfs2: remove unu... |
3521 3522 3523 3524 3525 3526 3527 |
/* * The merge code will need to create an empty * extent to take the place of the newly * emptied slot. Remove any pre-existing empty * extents - having more than one in a leaf is * illegal. */ |
70f18c08b ocfs2: ocfs2_rota... |
3528 |
ret = ocfs2_rotate_tree_left(handle, et, path, dealloc); |
518d7269f ocfs2: remove unu... |
3529 3530 3531 |
if (ret) { mlog_errno(ret); goto out; |
328d5752e ocfs2: btree chan... |
3532 |
} |
518d7269f ocfs2: remove unu... |
3533 3534 |
split_index--; rec = &el->l_recs[split_index]; |
328d5752e ocfs2: btree chan... |
3535 3536 3537 3538 3539 3540 3541 |
} if (ctxt->c_contig_type == CONTIG_LEFTRIGHT) { /* * Left-right contig implies this. */ BUG_ON(!ctxt->c_split_covers_rec); |
328d5752e ocfs2: btree chan... |
3542 3543 3544 3545 3546 3547 3548 3549 3550 3551 |
/* * Since the leftright insert always covers the entire * extent, this call will delete the insert record * entirely, resulting in an empty extent record added to * the extent block. * * Since the adding of an empty extent shifts * everything back to the right, there's no need to * update split_index here. |
677b97528 ocfs2: Add suppor... |
3552 3553 3554 3555 |
* * When the split_index is zero, we need to merge it to the * prevoius extent block. It is more efficient and easier * if we do merge_right first and merge_left later. |
328d5752e ocfs2: btree chan... |
3556 |
*/ |
4fe82c312 ocfs2: ocfs2_merg... |
3557 |
ret = ocfs2_merge_rec_right(path, handle, et, split_rec, |
677b97528 ocfs2: Add suppor... |
3558 |
split_index); |
328d5752e ocfs2: btree chan... |
3559 3560 3561 3562 3563 3564 3565 3566 3567 |
if (ret) { mlog_errno(ret); goto out; } /* * We can only get this from logic error above. */ BUG_ON(!ocfs2_is_empty_extent(&el->l_recs[0])); |
172159898 ocfs2: extend tra... |
3568 3569 3570 3571 3572 3573 3574 3575 |
/* extend credit for ocfs2_remove_rightmost_path */ ret = ocfs2_extend_rotate_transaction(handle, 0, handle->h_buffer_credits, path); if (ret) { mlog_errno(ret); goto out; } |
677b97528 ocfs2: Add suppor... |
3576 |
/* The merge left us with an empty extent, remove it. */ |
70f18c08b ocfs2: ocfs2_rota... |
3577 |
ret = ocfs2_rotate_tree_left(handle, et, path, dealloc); |
328d5752e ocfs2: btree chan... |
3578 3579 3580 3581 |
if (ret) { mlog_errno(ret); goto out; } |
677b97528 ocfs2: Add suppor... |
3582 |
|
328d5752e ocfs2: btree chan... |
3583 3584 3585 3586 |
rec = &el->l_recs[split_index]; /* * Note that we don't pass split_rec here on purpose - |
677b97528 ocfs2: Add suppor... |
3587 |
* we've merged it into the rec already. |
328d5752e ocfs2: btree chan... |
3588 |
*/ |
4fe82c312 ocfs2: ocfs2_merg... |
3589 3590 |
ret = ocfs2_merge_rec_left(path, handle, et, rec, dealloc, split_index); |
677b97528 ocfs2: Add suppor... |
3591 |
|
328d5752e ocfs2: btree chan... |
3592 3593 3594 3595 |
if (ret) { mlog_errno(ret); goto out; } |
172159898 ocfs2: extend tra... |
3596 3597 3598 3599 3600 3601 3602 3603 |
/* extend credit for ocfs2_remove_rightmost_path */ ret = ocfs2_extend_rotate_transaction(handle, 0, handle->h_buffer_credits, path); if (ret) { mlog_errno(ret); goto out; } |
70f18c08b ocfs2: ocfs2_rota... |
3604 |
ret = ocfs2_rotate_tree_left(handle, et, path, dealloc); |
328d5752e ocfs2: btree chan... |
3605 3606 3607 3608 3609 3610 3611 3612 3613 3614 3615 3616 3617 3618 3619 3620 |
/* * Error from this last rotate is not critical, so * print but don't bubble it up. */ if (ret) mlog_errno(ret); ret = 0; } else { /* * Merge a record to the left or right. * * 'contig_type' is relative to the existing record, * so for example, if we're "right contig", it's to * the record on the left (hence the left merge). */ if (ctxt->c_contig_type == CONTIG_RIGHT) { |
4fe82c312 ocfs2: ocfs2_merg... |
3621 3622 |
ret = ocfs2_merge_rec_left(path, handle, et, split_rec, dealloc, |
328d5752e ocfs2: btree chan... |
3623 3624 3625 3626 3627 3628 |
split_index); if (ret) { mlog_errno(ret); goto out; } } else { |
4fe82c312 ocfs2: ocfs2_merg... |
3629 |
ret = ocfs2_merge_rec_right(path, handle, |
7dc028056 ocfs2: Pass ocfs2... |
3630 |
et, split_rec, |
328d5752e ocfs2: btree chan... |
3631 3632 3633 3634 3635 3636 3637 3638 |
split_index); if (ret) { mlog_errno(ret); goto out; } } if (ctxt->c_split_covers_rec) { |
172159898 ocfs2: extend tra... |
3639 3640 3641 3642 3643 3644 3645 3646 3647 |
/* extend credit for ocfs2_remove_rightmost_path */ ret = ocfs2_extend_rotate_transaction(handle, 0, handle->h_buffer_credits, path); if (ret) { mlog_errno(ret); ret = 0; goto out; } |
328d5752e ocfs2: btree chan... |
3648 3649 3650 3651 |
/* * The merge may have left an empty extent in * our leaf. Try to rotate it away. */ |
70f18c08b ocfs2: ocfs2_rota... |
3652 3653 |
ret = ocfs2_rotate_tree_left(handle, et, path, dealloc); |
328d5752e ocfs2: btree chan... |
3654 3655 3656 3657 3658 3659 3660 3661 3662 3663 3664 3665 3666 3667 3668 3669 3670 3671 3672 3673 3674 3675 3676 3677 3678 3679 3680 3681 3682 3683 3684 3685 3686 3687 3688 3689 3690 3691 3692 3693 3694 3695 3696 3697 3698 |
if (ret) mlog_errno(ret); ret = 0; } } out: return ret; } static void ocfs2_subtract_from_rec(struct super_block *sb, enum ocfs2_split_type split, struct ocfs2_extent_rec *rec, struct ocfs2_extent_rec *split_rec) { u64 len_blocks; len_blocks = ocfs2_clusters_to_blocks(sb, le16_to_cpu(split_rec->e_leaf_clusters)); if (split == SPLIT_LEFT) { /* * Region is on the left edge of the existing * record. */ le32_add_cpu(&rec->e_cpos, le16_to_cpu(split_rec->e_leaf_clusters)); le64_add_cpu(&rec->e_blkno, len_blocks); le16_add_cpu(&rec->e_leaf_clusters, -le16_to_cpu(split_rec->e_leaf_clusters)); } else { /* * Region is on the right edge of the existing * record. */ le16_add_cpu(&rec->e_leaf_clusters, -le16_to_cpu(split_rec->e_leaf_clusters)); } } /* * Do the final bits of extent record insertion at the target leaf * list. If this leaf is part of an allocation tree, it is assumed * that the tree above has been prepared. */ |
d56286231 ocfs2: ocfs2_inse... |
3699 3700 |
static void ocfs2_insert_at_leaf(struct ocfs2_extent_tree *et, struct ocfs2_extent_rec *insert_rec, |
328d5752e ocfs2: btree chan... |
3701 |
struct ocfs2_extent_list *el, |
d56286231 ocfs2: ocfs2_inse... |
3702 |
struct ocfs2_insert_type *insert) |
328d5752e ocfs2: btree chan... |
3703 3704 3705 3706 3707 3708 3709 3710 3711 3712 3713 |
{ int i = insert->ins_contig_index; unsigned int range; struct ocfs2_extent_rec *rec; BUG_ON(le16_to_cpu(el->l_tree_depth) != 0); if (insert->ins_split != SPLIT_NONE) { i = ocfs2_search_extent_list(el, le32_to_cpu(insert_rec->e_cpos)); BUG_ON(i == -1); rec = &el->l_recs[i]; |
d56286231 ocfs2: ocfs2_inse... |
3714 3715 |
ocfs2_subtract_from_rec(ocfs2_metadata_cache_get_super(et->et_ci), insert->ins_split, rec, |
328d5752e ocfs2: btree chan... |
3716 3717 3718 3719 3720 3721 3722 3723 3724 3725 3726 3727 3728 3729 3730 3731 3732 3733 3734 3735 3736 3737 3738 3739 3740 3741 3742 3743 3744 3745 3746 3747 3748 3749 3750 3751 3752 3753 3754 3755 3756 |
insert_rec); goto rotate; } /* * Contiguous insert - either left or right. */ if (insert->ins_contig != CONTIG_NONE) { rec = &el->l_recs[i]; if (insert->ins_contig == CONTIG_LEFT) { rec->e_blkno = insert_rec->e_blkno; rec->e_cpos = insert_rec->e_cpos; } le16_add_cpu(&rec->e_leaf_clusters, le16_to_cpu(insert_rec->e_leaf_clusters)); return; } /* * Handle insert into an empty leaf. */ if (le16_to_cpu(el->l_next_free_rec) == 0 || ((le16_to_cpu(el->l_next_free_rec) == 1) && ocfs2_is_empty_extent(&el->l_recs[0]))) { el->l_recs[0] = *insert_rec; el->l_next_free_rec = cpu_to_le16(1); return; } /* * Appending insert. */ if (insert->ins_appending == APPEND_TAIL) { i = le16_to_cpu(el->l_next_free_rec) - 1; rec = &el->l_recs[i]; range = le32_to_cpu(rec->e_cpos) + le16_to_cpu(rec->e_leaf_clusters); BUG_ON(le32_to_cpu(insert_rec->e_cpos) < range); mlog_bug_on_msg(le16_to_cpu(el->l_next_free_rec) >= le16_to_cpu(el->l_count), |
d56286231 ocfs2: ocfs2_inse... |
3757 |
"owner %llu, depth %u, count %u, next free %u, " |
328d5752e ocfs2: btree chan... |
3758 3759 3760 |
"rec.cpos %u, rec.clusters %u, " "insert.cpos %u, insert.clusters %u ", |
d56286231 ocfs2: ocfs2_inse... |
3761 |
ocfs2_metadata_cache_owner(et->et_ci), |
328d5752e ocfs2: btree chan... |
3762 3763 3764 3765 3766 3767 3768 3769 3770 3771 3772 3773 3774 3775 3776 3777 3778 3779 3780 3781 3782 3783 3784 3785 3786 3787 |
le16_to_cpu(el->l_tree_depth), le16_to_cpu(el->l_count), le16_to_cpu(el->l_next_free_rec), le32_to_cpu(el->l_recs[i].e_cpos), le16_to_cpu(el->l_recs[i].e_leaf_clusters), le32_to_cpu(insert_rec->e_cpos), le16_to_cpu(insert_rec->e_leaf_clusters)); i++; el->l_recs[i] = *insert_rec; le16_add_cpu(&el->l_next_free_rec, 1); return; } rotate: /* * Ok, we have to rotate. * * At this point, it is safe to assume that inserting into an * empty leaf and appending to a leaf have both been handled * above. * * This leaf needs to have space, either by the empty 1st * extent record, or by virtue of an l_next_rec < l_count. */ ocfs2_rotate_leaf(el, insert_rec); } |
d401dc12f ocfs2: ocfs2_grow... |
3788 3789 |
static void ocfs2_adjust_rightmost_records(handle_t *handle, struct ocfs2_extent_tree *et, |
328d5752e ocfs2: btree chan... |
3790 3791 3792 3793 3794 3795 3796 3797 3798 3799 3800 3801 3802 3803 |
struct ocfs2_path *path, struct ocfs2_extent_rec *insert_rec) { int ret, i, next_free; struct buffer_head *bh; struct ocfs2_extent_list *el; struct ocfs2_extent_rec *rec; /* * Update everything except the leaf block. */ for (i = 0; i < path->p_tree_depth; i++) { bh = path->p_node[i].bh; el = path->p_node[i].el; |
dcd0538ff ocfs2: sparse b-t... |
3804 3805 |
next_free = le16_to_cpu(el->l_next_free_rec); if (next_free == 0) { |
d401dc12f ocfs2: ocfs2_grow... |
3806 |
ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci), |
7ecef14ab ocfs2: neaten do_... |
3807 3808 |
"Owner %llu has a bad extent list ", |
d401dc12f ocfs2: ocfs2_grow... |
3809 |
(unsigned long long)ocfs2_metadata_cache_owner(et->et_ci)); |
dcd0538ff ocfs2: sparse b-t... |
3810 |
ret = -EIO; |
328d5752e ocfs2: btree chan... |
3811 3812 3813 3814 3815 3816 3817 3818 3819 3820 |
return; } rec = &el->l_recs[next_free - 1]; rec->e_int_clusters = insert_rec->e_cpos; le32_add_cpu(&rec->e_int_clusters, le16_to_cpu(insert_rec->e_leaf_clusters)); le32_add_cpu(&rec->e_int_clusters, -le32_to_cpu(rec->e_cpos)); |
ec20cec7a ocfs2: Make ocfs2... |
3821 |
ocfs2_journal_dirty(handle, bh); |
328d5752e ocfs2: btree chan... |
3822 3823 |
} } |
d401dc12f ocfs2: ocfs2_grow... |
3824 3825 |
static int ocfs2_append_rec_to_path(handle_t *handle, struct ocfs2_extent_tree *et, |
328d5752e ocfs2: btree chan... |
3826 3827 3828 3829 3830 3831 3832 3833 3834 3835 3836 3837 3838 3839 3840 3841 3842 3843 3844 3845 3846 3847 3848 3849 3850 3851 |
struct ocfs2_extent_rec *insert_rec, struct ocfs2_path *right_path, struct ocfs2_path **ret_left_path) { int ret, next_free; struct ocfs2_extent_list *el; struct ocfs2_path *left_path = NULL; *ret_left_path = NULL; /* * This shouldn't happen for non-trees. The extent rec cluster * count manipulation below only works for interior nodes. */ BUG_ON(right_path->p_tree_depth == 0); /* * If our appending insert is at the leftmost edge of a leaf, * then we might need to update the rightmost records of the * neighboring path. */ el = path_leaf_el(right_path); next_free = le16_to_cpu(el->l_next_free_rec); if (next_free == 0 || (next_free == 1 && ocfs2_is_empty_extent(&el->l_recs[0]))) { u32 left_cpos; |
d401dc12f ocfs2: ocfs2_grow... |
3852 3853 |
ret = ocfs2_find_cpos_for_left_leaf(ocfs2_metadata_cache_get_super(et->et_ci), right_path, &left_cpos); |
328d5752e ocfs2: btree chan... |
3854 3855 |
if (ret) { mlog_errno(ret); |
dcd0538ff ocfs2: sparse b-t... |
3856 3857 |
goto out; } |
a09d09b8f ocfs2: Remove mlo... |
3858 3859 3860 3861 3862 |
trace_ocfs2_append_rec_to_path( (unsigned long long) ocfs2_metadata_cache_owner(et->et_ci), le32_to_cpu(insert_rec->e_cpos), left_cpos); |
e48edee2d ocfs2: make room ... |
3863 |
|
328d5752e ocfs2: btree chan... |
3864 3865 3866 3867 3868 |
/* * No need to worry if the append is already in the * leftmost leaf. */ if (left_cpos) { |
ffdd7a546 ocfs2: Wrap up th... |
3869 |
left_path = ocfs2_new_path_from_path(right_path); |
328d5752e ocfs2: btree chan... |
3870 3871 3872 3873 3874 |
if (!left_path) { ret = -ENOMEM; mlog_errno(ret); goto out; } |
dcd0538ff ocfs2: sparse b-t... |
3875 |
|
d401dc12f ocfs2: ocfs2_grow... |
3876 |
ret = ocfs2_find_path(et->et_ci, left_path, |
facdb77f5 ocfs2: ocfs2_find... |
3877 |
left_cpos); |
328d5752e ocfs2: btree chan... |
3878 3879 3880 3881 |
if (ret) { mlog_errno(ret); goto out; } |
dcd0538ff ocfs2: sparse b-t... |
3882 |
|
328d5752e ocfs2: btree chan... |
3883 3884 3885 3886 3887 3888 |
/* * ocfs2_insert_path() will pass the left_path to the * journal for us. */ } } |
dcd0538ff ocfs2: sparse b-t... |
3889 |
|
d401dc12f ocfs2: ocfs2_grow... |
3890 |
ret = ocfs2_journal_access_path(et->et_ci, handle, right_path); |
328d5752e ocfs2: btree chan... |
3891 3892 3893 |
if (ret) { mlog_errno(ret); goto out; |
dcd0538ff ocfs2: sparse b-t... |
3894 |
} |
d401dc12f ocfs2: ocfs2_grow... |
3895 |
ocfs2_adjust_rightmost_records(handle, et, right_path, insert_rec); |
328d5752e ocfs2: btree chan... |
3896 |
|
dcd0538ff ocfs2: sparse b-t... |
3897 3898 3899 3900 3901 3902 3903 3904 |
*ret_left_path = left_path; ret = 0; out: if (ret != 0) ocfs2_free_path(left_path); return ret; } |
c38e52bb1 ocfs2: Give ocfs2... |
3905 |
static void ocfs2_split_record(struct ocfs2_extent_tree *et, |
328d5752e ocfs2: btree chan... |
3906 3907 3908 3909 3910 3911 3912 3913 3914 |
struct ocfs2_path *left_path, struct ocfs2_path *right_path, struct ocfs2_extent_rec *split_rec, enum ocfs2_split_type split) { int index; u32 cpos = le32_to_cpu(split_rec->e_cpos); struct ocfs2_extent_list *left_el = NULL, *right_el, *insert_el, *el; struct ocfs2_extent_rec *rec, *tmprec; |
c19a28e11 remove lots of do... |
3915 |
right_el = path_leaf_el(right_path); |
328d5752e ocfs2: btree chan... |
3916 3917 3918 3919 3920 3921 3922 3923 3924 3925 3926 3927 3928 3929 3930 3931 3932 3933 3934 3935 3936 3937 3938 3939 3940 3941 3942 3943 3944 3945 3946 3947 3948 3949 3950 3951 3952 3953 3954 3955 3956 3957 3958 3959 3960 3961 3962 3963 3964 3965 3966 3967 3968 3969 3970 3971 3972 3973 3974 3975 3976 |
if (left_path) left_el = path_leaf_el(left_path); el = right_el; insert_el = right_el; index = ocfs2_search_extent_list(el, cpos); if (index != -1) { if (index == 0 && left_path) { BUG_ON(ocfs2_is_empty_extent(&el->l_recs[0])); /* * This typically means that the record * started in the left path but moved to the * right as a result of rotation. We either * move the existing record to the left, or we * do the later insert there. * * In this case, the left path should always * exist as the rotate code will have passed * it back for a post-insert update. */ if (split == SPLIT_LEFT) { /* * It's a left split. Since we know * that the rotate code gave us an * empty extent in the left path, we * can just do the insert there. */ insert_el = left_el; } else { /* * Right split - we have to move the * existing record over to the left * leaf. The insert will be into the * newly created empty extent in the * right leaf. */ tmprec = &right_el->l_recs[index]; ocfs2_rotate_leaf(left_el, tmprec); el = left_el; memset(tmprec, 0, sizeof(*tmprec)); index = ocfs2_search_extent_list(left_el, cpos); BUG_ON(index == -1); } } } else { BUG_ON(!left_path); BUG_ON(!ocfs2_is_empty_extent(&left_el->l_recs[0])); /* * Left path is easy - we can just allow the insert to * happen. */ el = left_el; insert_el = left_el; index = ocfs2_search_extent_list(el, cpos); BUG_ON(index == -1); } rec = &el->l_recs[index]; |
c38e52bb1 ocfs2: Give ocfs2... |
3977 3978 |
ocfs2_subtract_from_rec(ocfs2_metadata_cache_get_super(et->et_ci), split, rec, split_rec); |
328d5752e ocfs2: btree chan... |
3979 3980 |
ocfs2_rotate_leaf(insert_el, split_rec); } |
dcd0538ff ocfs2: sparse b-t... |
3981 |
/* |
e7d4cb6bc ocfs2: Abstract o... |
3982 3983 |
* This function only does inserts on an allocation b-tree. For tree * depth = 0, ocfs2_insert_at_leaf() is called directly. |
dcd0538ff ocfs2: sparse b-t... |
3984 3985 3986 3987 3988 |
* * right_path is the path we want to do the actual insert * in. left_path should only be passed in if we need to update that * portion of the tree after an edge insert. */ |
3505bec01 ocfs2: ocfs2_do_i... |
3989 |
static int ocfs2_insert_path(handle_t *handle, |
7dc028056 ocfs2: Pass ocfs2... |
3990 |
struct ocfs2_extent_tree *et, |
dcd0538ff ocfs2: sparse b-t... |
3991 3992 3993 3994 3995 3996 3997 |
struct ocfs2_path *left_path, struct ocfs2_path *right_path, struct ocfs2_extent_rec *insert_rec, struct ocfs2_insert_type *insert) { int ret, subtree_index; struct buffer_head *leaf_bh = path_leaf_bh(right_path); |
dcd0538ff ocfs2: sparse b-t... |
3998 |
|
dcd0538ff ocfs2: sparse b-t... |
3999 |
if (left_path) { |
dcd0538ff ocfs2: sparse b-t... |
4000 4001 4002 4003 4004 4005 |
/* * There's a chance that left_path got passed back to * us without being accounted for in the * journal. Extend our transaction here to be sure we * can change those blocks. */ |
c901fb007 ocfs2: Make ocfs2... |
4006 |
ret = ocfs2_extend_trans(handle, left_path->p_tree_depth); |
dcd0538ff ocfs2: sparse b-t... |
4007 4008 4009 4010 |
if (ret < 0) { mlog_errno(ret); goto out; } |
7dc028056 ocfs2: Pass ocfs2... |
4011 |
ret = ocfs2_journal_access_path(et->et_ci, handle, left_path); |
dcd0538ff ocfs2: sparse b-t... |
4012 4013 4014 4015 4016 |
if (ret < 0) { mlog_errno(ret); goto out; } } |
e8aed3450 ocfs2: Re-journal... |
4017 4018 4019 4020 |
/* * Pass both paths to the journal. The majority of inserts * will be touching all components anyway. */ |
7dc028056 ocfs2: Pass ocfs2... |
4021 |
ret = ocfs2_journal_access_path(et->et_ci, handle, right_path); |
e8aed3450 ocfs2: Re-journal... |
4022 4023 4024 4025 |
if (ret < 0) { mlog_errno(ret); goto out; } |
328d5752e ocfs2: btree chan... |
4026 4027 4028 |
if (insert->ins_split != SPLIT_NONE) { /* * We could call ocfs2_insert_at_leaf() for some types |
c78bad11f fs/: Spelling fixes |
4029 |
* of splits, but it's easier to just let one separate |
328d5752e ocfs2: btree chan... |
4030 4031 |
* function sort it all out. */ |
c38e52bb1 ocfs2: Give ocfs2... |
4032 |
ocfs2_split_record(et, left_path, right_path, |
328d5752e ocfs2: btree chan... |
4033 |
insert_rec, insert->ins_split); |
e8aed3450 ocfs2: Re-journal... |
4034 4035 4036 4037 4038 4039 4040 |
/* * Split might have modified either leaf and we don't * have a guarantee that the later edge insert will * dirty this for us. */ if (left_path) |
ec20cec7a ocfs2: Make ocfs2... |
4041 4042 |
ocfs2_journal_dirty(handle, path_leaf_bh(left_path)); |
328d5752e ocfs2: btree chan... |
4043 |
} else |
d56286231 ocfs2: ocfs2_inse... |
4044 4045 |
ocfs2_insert_at_leaf(et, insert_rec, path_leaf_el(right_path), insert); |
dcd0538ff ocfs2: sparse b-t... |
4046 |
|
ec20cec7a ocfs2: Make ocfs2... |
4047 |
ocfs2_journal_dirty(handle, leaf_bh); |
dcd0538ff ocfs2: sparse b-t... |
4048 4049 4050 4051 4052 4053 4054 4055 |
if (left_path) { /* * The rotate code has indicated that we need to fix * up portions of the tree after the insert. * * XXX: Should we extend the transaction here? */ |
7dc028056 ocfs2: Pass ocfs2... |
4056 |
subtree_index = ocfs2_find_subtree_root(et, left_path, |
dcd0538ff ocfs2: sparse b-t... |
4057 |
right_path); |
4619c73e7 ocfs2: ocfs2_comp... |
4058 4059 |
ocfs2_complete_edge_insert(handle, left_path, right_path, subtree_index); |
dcd0538ff ocfs2: sparse b-t... |
4060 4061 4062 4063 4064 4065 |
} ret = 0; out: return ret; } |
3505bec01 ocfs2: ocfs2_do_i... |
4066 |
static int ocfs2_do_insert_extent(handle_t *handle, |
e7d4cb6bc ocfs2: Abstract o... |
4067 |
struct ocfs2_extent_tree *et, |
dcd0538ff ocfs2: sparse b-t... |
4068 4069 4070 4071 4072 4073 4074 |
struct ocfs2_extent_rec *insert_rec, struct ocfs2_insert_type *type) { int ret, rotate = 0; u32 cpos; struct ocfs2_path *right_path = NULL; struct ocfs2_path *left_path = NULL; |
dcd0538ff ocfs2: sparse b-t... |
4075 |
struct ocfs2_extent_list *el; |
ce1d9ea62 ocfs2: Prefix the... |
4076 |
el = et->et_root_el; |
dcd0538ff ocfs2: sparse b-t... |
4077 |
|
d9a0a1f83 ocfs2: Store the ... |
4078 |
ret = ocfs2_et_root_journal_access(handle, et, |
13723d00e ocfs2: Use metada... |
4079 |
OCFS2_JOURNAL_ACCESS_WRITE); |
dcd0538ff ocfs2: sparse b-t... |
4080 4081 4082 4083 4084 4085 |
if (ret) { mlog_errno(ret); goto out; } if (le16_to_cpu(el->l_tree_depth) == 0) { |
d56286231 ocfs2: ocfs2_inse... |
4086 |
ocfs2_insert_at_leaf(et, insert_rec, el, type); |
dcd0538ff ocfs2: sparse b-t... |
4087 4088 |
goto out_update_clusters; } |
ffdd7a546 ocfs2: Wrap up th... |
4089 |
right_path = ocfs2_new_path_from_et(et); |
dcd0538ff ocfs2: sparse b-t... |
4090 4091 4092 4093 4094 4095 4096 4097 4098 4099 4100 4101 4102 4103 4104 4105 4106 |
if (!right_path) { ret = -ENOMEM; mlog_errno(ret); goto out; } /* * Determine the path to start with. Rotations need the * rightmost path, everything else can go directly to the * target leaf. */ cpos = le32_to_cpu(insert_rec->e_cpos); if (type->ins_appending == APPEND_NONE && type->ins_contig == CONTIG_NONE) { rotate = 1; cpos = UINT_MAX; } |
facdb77f5 ocfs2: ocfs2_find... |
4107 |
ret = ocfs2_find_path(et->et_ci, right_path, cpos); |
dcd0538ff ocfs2: sparse b-t... |
4108 4109 4110 4111 4112 4113 4114 4115 4116 4117 4118 4119 4120 4121 4122 4123 4124 4125 |
if (ret) { mlog_errno(ret); goto out; } /* * Rotations and appends need special treatment - they modify * parts of the tree's above them. * * Both might pass back a path immediate to the left of the * one being inserted to. This will be cause * ocfs2_insert_path() to modify the rightmost records of * left_path to account for an edge insert. * * XXX: When modifying this code, keep in mind that an insert * can wind up skipping both of these two special cases... */ if (rotate) { |
1bbf0b8d6 ocfs2: ocfs2_rota... |
4126 |
ret = ocfs2_rotate_tree_right(handle, et, type->ins_split, |
dcd0538ff ocfs2: sparse b-t... |
4127 4128 4129 4130 4131 4132 |
le32_to_cpu(insert_rec->e_cpos), right_path, &left_path); if (ret) { mlog_errno(ret); goto out; } |
e8aed3450 ocfs2: Re-journal... |
4133 4134 4135 4136 4137 |
/* * ocfs2_rotate_tree_right() might have extended the * transaction without re-journaling our tree root. */ |
d9a0a1f83 ocfs2: Store the ... |
4138 |
ret = ocfs2_et_root_journal_access(handle, et, |
13723d00e ocfs2: Use metada... |
4139 |
OCFS2_JOURNAL_ACCESS_WRITE); |
e8aed3450 ocfs2: Re-journal... |
4140 4141 4142 4143 |
if (ret) { mlog_errno(ret); goto out; } |
dcd0538ff ocfs2: sparse b-t... |
4144 4145 |
} else if (type->ins_appending == APPEND_TAIL && type->ins_contig != CONTIG_LEFT) { |
d401dc12f ocfs2: ocfs2_grow... |
4146 |
ret = ocfs2_append_rec_to_path(handle, et, insert_rec, |
dcd0538ff ocfs2: sparse b-t... |
4147 4148 4149 4150 4151 4152 |
right_path, &left_path); if (ret) { mlog_errno(ret); goto out; } } |
3505bec01 ocfs2: ocfs2_do_i... |
4153 |
ret = ocfs2_insert_path(handle, et, left_path, right_path, |
dcd0538ff ocfs2: sparse b-t... |
4154 4155 4156 4157 4158 4159 4160 |
insert_rec, type); if (ret) { mlog_errno(ret); goto out; } out_update_clusters: |
328d5752e ocfs2: btree chan... |
4161 |
if (type->ins_split == SPLIT_NONE) |
6136ca5f5 ocfs2: Drop struc... |
4162 |
ocfs2_et_update_clusters(et, |
35dc0aa3c ocfs2: Prefix the... |
4163 |
le16_to_cpu(insert_rec->e_leaf_clusters)); |
dcd0538ff ocfs2: sparse b-t... |
4164 |
|
ec20cec7a ocfs2: Make ocfs2... |
4165 |
ocfs2_journal_dirty(handle, et->et_root_bh); |
dcd0538ff ocfs2: sparse b-t... |
4166 4167 4168 4169 4170 4171 4172 |
out: ocfs2_free_path(left_path); ocfs2_free_path(right_path); return ret; } |
9f99ad086 ocfs2: return err... |
4173 |
static int ocfs2_figure_merge_contig_type(struct ocfs2_extent_tree *et, |
a29702914 ocfs2: Swap inode... |
4174 |
struct ocfs2_path *path, |
328d5752e ocfs2: btree chan... |
4175 |
struct ocfs2_extent_list *el, int index, |
9f99ad086 ocfs2: return err... |
4176 4177 |
struct ocfs2_extent_rec *split_rec, struct ocfs2_merge_ctxt *ctxt) |
328d5752e ocfs2: btree chan... |
4178 |
{ |
9f99ad086 ocfs2: return err... |
4179 |
int status = 0; |
328d5752e ocfs2: btree chan... |
4180 |
enum ocfs2_contig_type ret = CONTIG_NONE; |
ad5a4d709 ocfs2: Enable cro... |
4181 4182 4183 4184 4185 4186 |
u32 left_cpos, right_cpos; struct ocfs2_extent_rec *rec = NULL; struct ocfs2_extent_list *new_el; struct ocfs2_path *left_path = NULL, *right_path = NULL; struct buffer_head *bh; struct ocfs2_extent_block *eb; |
a29702914 ocfs2: Swap inode... |
4187 |
struct super_block *sb = ocfs2_metadata_cache_get_super(et->et_ci); |
ad5a4d709 ocfs2: Enable cro... |
4188 4189 4190 4191 |
if (index > 0) { rec = &el->l_recs[index - 1]; } else if (path->p_tree_depth > 0) { |
a29702914 ocfs2: Swap inode... |
4192 |
status = ocfs2_find_cpos_for_left_leaf(sb, path, &left_cpos); |
ad5a4d709 ocfs2: Enable cro... |
4193 |
if (status) |
06a269ccd ocfs2: less funct... |
4194 |
goto exit; |
ad5a4d709 ocfs2: Enable cro... |
4195 4196 |
if (left_cpos != 0) { |
ffdd7a546 ocfs2: Wrap up th... |
4197 |
left_path = ocfs2_new_path_from_path(path); |
9f99ad086 ocfs2: return err... |
4198 4199 4200 |
if (!left_path) { status = -ENOMEM; mlog_errno(status); |
06a269ccd ocfs2: less funct... |
4201 |
goto exit; |
9f99ad086 ocfs2: return err... |
4202 |
} |
ad5a4d709 ocfs2: Enable cro... |
4203 |
|
a29702914 ocfs2: Swap inode... |
4204 4205 |
status = ocfs2_find_path(et->et_ci, left_path, left_cpos); |
ad5a4d709 ocfs2: Enable cro... |
4206 |
if (status) |
06a269ccd ocfs2: less funct... |
4207 |
goto free_left_path; |
ad5a4d709 ocfs2: Enable cro... |
4208 4209 4210 4211 4212 4213 4214 |
new_el = path_leaf_el(left_path); if (le16_to_cpu(new_el->l_next_free_rec) != le16_to_cpu(new_el->l_count)) { bh = path_leaf_bh(left_path); eb = (struct ocfs2_extent_block *)bh->b_data; |
a29702914 ocfs2: Swap inode... |
4215 |
ocfs2_error(sb, |
7ecef14ab ocfs2: neaten do_... |
4216 4217 |
"Extent block #%llu has an invalid l_next_free_rec of %d. It should have matched the l_count of %d ", |
5e96581a3 ocfs2: Wrap exten... |
4218 4219 4220 4221 |
(unsigned long long)le64_to_cpu(eb->h_blkno), le16_to_cpu(new_el->l_next_free_rec), le16_to_cpu(new_el->l_count)); status = -EINVAL; |
06a269ccd ocfs2: less funct... |
4222 |
goto free_left_path; |
ad5a4d709 ocfs2: Enable cro... |
4223 4224 4225 4226 4227 |
} rec = &new_el->l_recs[ le16_to_cpu(new_el->l_next_free_rec) - 1]; } } |
328d5752e ocfs2: btree chan... |
4228 4229 4230 4231 4232 |
/* * We're careful to check for an empty extent record here - * the merge code will know what to do if it sees one. */ |
ad5a4d709 ocfs2: Enable cro... |
4233 |
if (rec) { |
328d5752e ocfs2: btree chan... |
4234 4235 4236 4237 |
if (index == 1 && ocfs2_is_empty_extent(rec)) { if (split_rec->e_cpos == el->l_recs[index].e_cpos) ret = CONTIG_RIGHT; } else { |
853a3a143 ocfs2: Wrap ocfs2... |
4238 |
ret = ocfs2_et_extent_contig(et, rec, split_rec); |
328d5752e ocfs2: btree chan... |
4239 4240 |
} } |
ad5a4d709 ocfs2: Enable cro... |
4241 4242 4243 4244 4245 |
rec = NULL; if (index < (le16_to_cpu(el->l_next_free_rec) - 1)) rec = &el->l_recs[index + 1]; else if (le16_to_cpu(el->l_next_free_rec) == le16_to_cpu(el->l_count) && path->p_tree_depth > 0) { |
a29702914 ocfs2: Swap inode... |
4246 |
status = ocfs2_find_cpos_for_right_leaf(sb, path, &right_cpos); |
ad5a4d709 ocfs2: Enable cro... |
4247 |
if (status) |
06a269ccd ocfs2: less funct... |
4248 |
goto free_left_path; |
ad5a4d709 ocfs2: Enable cro... |
4249 4250 |
if (right_cpos == 0) |
06a269ccd ocfs2: less funct... |
4251 |
goto free_left_path; |
ad5a4d709 ocfs2: Enable cro... |
4252 |
|
ffdd7a546 ocfs2: Wrap up th... |
4253 |
right_path = ocfs2_new_path_from_path(path); |
9f99ad086 ocfs2: return err... |
4254 4255 4256 |
if (!right_path) { status = -ENOMEM; mlog_errno(status); |
06a269ccd ocfs2: less funct... |
4257 |
goto free_left_path; |
9f99ad086 ocfs2: return err... |
4258 |
} |
ad5a4d709 ocfs2: Enable cro... |
4259 |
|
a29702914 ocfs2: Swap inode... |
4260 |
status = ocfs2_find_path(et->et_ci, right_path, right_cpos); |
ad5a4d709 ocfs2: Enable cro... |
4261 |
if (status) |
06a269ccd ocfs2: less funct... |
4262 |
goto free_right_path; |
ad5a4d709 ocfs2: Enable cro... |
4263 4264 4265 4266 4267 4268 4269 |
new_el = path_leaf_el(right_path); rec = &new_el->l_recs[0]; if (ocfs2_is_empty_extent(rec)) { if (le16_to_cpu(new_el->l_next_free_rec) <= 1) { bh = path_leaf_bh(right_path); eb = (struct ocfs2_extent_block *)bh->b_data; |
a29702914 ocfs2: Swap inode... |
4270 |
ocfs2_error(sb, |
7ecef14ab ocfs2: neaten do_... |
4271 4272 |
"Extent block #%llu has an invalid l_next_free_rec of %d ", |
5e96581a3 ocfs2: Wrap exten... |
4273 4274 4275 |
(unsigned long long)le64_to_cpu(eb->h_blkno), le16_to_cpu(new_el->l_next_free_rec)); status = -EINVAL; |
06a269ccd ocfs2: less funct... |
4276 |
goto free_right_path; |
ad5a4d709 ocfs2: Enable cro... |
4277 4278 4279 4280 4281 4282 |
} rec = &new_el->l_recs[1]; } } if (rec) { |
328d5752e ocfs2: btree chan... |
4283 |
enum ocfs2_contig_type contig_type; |
853a3a143 ocfs2: Wrap ocfs2... |
4284 |
contig_type = ocfs2_et_extent_contig(et, rec, split_rec); |
328d5752e ocfs2: btree chan... |
4285 4286 4287 4288 4289 4290 |
if (contig_type == CONTIG_LEFT && ret == CONTIG_RIGHT) ret = CONTIG_LEFTRIGHT; else if (ret == CONTIG_NONE) ret = contig_type; } |
06a269ccd ocfs2: less funct... |
4291 |
free_right_path: |
fd90d4dfb ocfs2: delete unn... |
4292 |
ocfs2_free_path(right_path); |
06a269ccd ocfs2: less funct... |
4293 4294 4295 |
free_left_path: ocfs2_free_path(left_path); exit: |
9f99ad086 ocfs2: return err... |
4296 4297 4298 4299 |
if (status == 0) ctxt->c_contig_type = ret; return status; |
328d5752e ocfs2: btree chan... |
4300 |
} |
1ef61b331 ocfs2: Remove ino... |
4301 |
static void ocfs2_figure_contig_type(struct ocfs2_extent_tree *et, |
dcd0538ff ocfs2: sparse b-t... |
4302 4303 |
struct ocfs2_insert_type *insert, struct ocfs2_extent_list *el, |
1ef61b331 ocfs2: Remove ino... |
4304 |
struct ocfs2_extent_rec *insert_rec) |
dcd0538ff ocfs2: sparse b-t... |
4305 4306 4307 |
{ int i; enum ocfs2_contig_type contig_type = CONTIG_NONE; |
e48edee2d ocfs2: make room ... |
4308 |
BUG_ON(le16_to_cpu(el->l_tree_depth) != 0); |
dcd0538ff ocfs2: sparse b-t... |
4309 |
for(i = 0; i < le16_to_cpu(el->l_next_free_rec); i++) { |
853a3a143 ocfs2: Wrap ocfs2... |
4310 4311 |
contig_type = ocfs2_et_extent_contig(et, &el->l_recs[i], insert_rec); |
dcd0538ff ocfs2: sparse b-t... |
4312 4313 4314 4315 4316 4317 |
if (contig_type != CONTIG_NONE) { insert->ins_contig_index = i; break; } } insert->ins_contig = contig_type; |
ca12b7c48 ocfs2: Optionally... |
4318 4319 4320 4321 4322 4323 4324 4325 4326 4327 4328 |
if (insert->ins_contig != CONTIG_NONE) { struct ocfs2_extent_rec *rec = &el->l_recs[insert->ins_contig_index]; unsigned int len = le16_to_cpu(rec->e_leaf_clusters) + le16_to_cpu(insert_rec->e_leaf_clusters); /* * Caller might want us to limit the size of extents, don't * calculate contiguousness if we might exceed that limit. */ |
ce1d9ea62 ocfs2: Prefix the... |
4329 4330 |
if (et->et_max_leaf_clusters && (len > et->et_max_leaf_clusters)) |
ca12b7c48 ocfs2: Optionally... |
4331 4332 |
insert->ins_contig = CONTIG_NONE; } |
dcd0538ff ocfs2: sparse b-t... |
4333 4334 4335 4336 4337 4338 4339 4340 |
} /* * This should only be called against the righmost leaf extent list. * * ocfs2_figure_appending_type() will figure out whether we'll have to * insert at the tail of the rightmost leaf. * |
e7d4cb6bc ocfs2: Abstract o... |
4341 4342 |
* This should also work against the root extent list for tree's with 0 * depth. If we consider the root extent list to be the rightmost leaf node |
dcd0538ff ocfs2: sparse b-t... |
4343 4344 4345 4346 4347 4348 4349 4350 4351 4352 4353 |
* then the logic here makes sense. */ static void ocfs2_figure_appending_type(struct ocfs2_insert_type *insert, struct ocfs2_extent_list *el, struct ocfs2_extent_rec *insert_rec) { int i; u32 cpos = le32_to_cpu(insert_rec->e_cpos); struct ocfs2_extent_rec *rec; insert->ins_appending = APPEND_NONE; |
e48edee2d ocfs2: make room ... |
4354 |
BUG_ON(le16_to_cpu(el->l_tree_depth) != 0); |
dcd0538ff ocfs2: sparse b-t... |
4355 4356 4357 4358 4359 4360 4361 4362 4363 4364 4365 4366 |
if (!el->l_next_free_rec) goto set_tail_append; if (ocfs2_is_empty_extent(&el->l_recs[0])) { /* Were all records empty? */ if (le16_to_cpu(el->l_next_free_rec) == 1) goto set_tail_append; } i = le16_to_cpu(el->l_next_free_rec) - 1; rec = &el->l_recs[i]; |
e48edee2d ocfs2: make room ... |
4367 4368 |
if (cpos >= (le32_to_cpu(rec->e_cpos) + le16_to_cpu(rec->e_leaf_clusters))) |
dcd0538ff ocfs2: sparse b-t... |
4369 4370 4371 4372 4373 4374 4375 4376 4377 |
goto set_tail_append; return; set_tail_append: insert->ins_appending = APPEND_TAIL; } /* |
25985edce Fix common misspe... |
4378 |
* Helper function called at the beginning of an insert. |
dcd0538ff ocfs2: sparse b-t... |
4379 4380 4381 4382 4383 4384 4385 4386 4387 4388 4389 |
* * This computes a few things that are commonly used in the process of * inserting into the btree: * - Whether the new extent is contiguous with an existing one. * - The current tree depth. * - Whether the insert is an appending one. * - The total # of free records in the tree. * * All of the information is stored on the ocfs2_insert_type * structure. */ |
627961b77 ocfs2: ocfs2_figu... |
4390 |
static int ocfs2_figure_insert_type(struct ocfs2_extent_tree *et, |
dcd0538ff ocfs2: sparse b-t... |
4391 4392 |
struct buffer_head **last_eb_bh, struct ocfs2_extent_rec *insert_rec, |
c77534f6f ocfs2: remove mos... |
4393 |
int *free_records, |
dcd0538ff ocfs2: sparse b-t... |
4394 4395 4396 |
struct ocfs2_insert_type *insert) { int ret; |
dcd0538ff ocfs2: sparse b-t... |
4397 4398 4399 4400 |
struct ocfs2_extent_block *eb; struct ocfs2_extent_list *el; struct ocfs2_path *path = NULL; struct buffer_head *bh = NULL; |
328d5752e ocfs2: btree chan... |
4401 |
insert->ins_split = SPLIT_NONE; |
ce1d9ea62 ocfs2: Prefix the... |
4402 |
el = et->et_root_el; |
dcd0538ff ocfs2: sparse b-t... |
4403 4404 4405 4406 4407 4408 4409 4410 4411 |
insert->ins_tree_depth = le16_to_cpu(el->l_tree_depth); if (el->l_tree_depth) { /* * If we have tree depth, we read in the * rightmost extent block ahead of time as * ocfs2_figure_insert_type() and ocfs2_add_branch() * may want it later. */ |
3d03a305d ocfs2: Pass ocfs2... |
4412 |
ret = ocfs2_read_extent_block(et->et_ci, |
5e96581a3 ocfs2: Wrap exten... |
4413 4414 |
ocfs2_et_get_last_eb_blk(et), &bh); |
dcd0538ff ocfs2: sparse b-t... |
4415 |
if (ret) { |
c1e8d35ef ocfs2: Remove EXI... |
4416 |
mlog_errno(ret); |
dcd0538ff ocfs2: sparse b-t... |
4417 4418 |
goto out; } |
ccd979bdb [PATCH] OCFS2: Th... |
4419 |
eb = (struct ocfs2_extent_block *) bh->b_data; |
ccd979bdb [PATCH] OCFS2: Th... |
4420 |
el = &eb->h_list; |
dcd0538ff ocfs2: sparse b-t... |
4421 |
} |
ccd979bdb [PATCH] OCFS2: Th... |
4422 |
|
dcd0538ff ocfs2: sparse b-t... |
4423 4424 4425 4426 4427 4428 4429 4430 |
/* * Unless we have a contiguous insert, we'll need to know if * there is room left in our allocation tree for another * extent record. * * XXX: This test is simplistic, we can search for empty * extent records too. */ |
c77534f6f ocfs2: remove mos... |
4431 |
*free_records = le16_to_cpu(el->l_count) - |
dcd0538ff ocfs2: sparse b-t... |
4432 4433 4434 |
le16_to_cpu(el->l_next_free_rec); if (!insert->ins_tree_depth) { |
1ef61b331 ocfs2: Remove ino... |
4435 |
ocfs2_figure_contig_type(et, insert, el, insert_rec); |
dcd0538ff ocfs2: sparse b-t... |
4436 4437 |
ocfs2_figure_appending_type(insert, el, insert_rec); return 0; |
ccd979bdb [PATCH] OCFS2: Th... |
4438 |
} |
ffdd7a546 ocfs2: Wrap up th... |
4439 |
path = ocfs2_new_path_from_et(et); |
dcd0538ff ocfs2: sparse b-t... |
4440 4441 4442 4443 4444 |
if (!path) { ret = -ENOMEM; mlog_errno(ret); goto out; } |
ccd979bdb [PATCH] OCFS2: Th... |
4445 |
|
dcd0538ff ocfs2: sparse b-t... |
4446 4447 4448 4449 4450 4451 |
/* * In the case that we're inserting past what the tree * currently accounts for, ocfs2_find_path() will return for * us the rightmost tree path. This is accounted for below in * the appending code. */ |
facdb77f5 ocfs2: ocfs2_find... |
4452 |
ret = ocfs2_find_path(et->et_ci, path, le32_to_cpu(insert_rec->e_cpos)); |
dcd0538ff ocfs2: sparse b-t... |
4453 4454 4455 4456 |
if (ret) { mlog_errno(ret); goto out; } |
ccd979bdb [PATCH] OCFS2: Th... |
4457 |
|
dcd0538ff ocfs2: sparse b-t... |
4458 4459 4460 4461 4462 4463 4464 4465 4466 4467 |
el = path_leaf_el(path); /* * Now that we have the path, there's two things we want to determine: * 1) Contiguousness (also set contig_index if this is so) * * 2) Are we doing an append? We can trivially break this up * into two types of appends: simple record append, or a * rotate inside the tail leaf. */ |
1ef61b331 ocfs2: Remove ino... |
4468 |
ocfs2_figure_contig_type(et, insert, el, insert_rec); |
dcd0538ff ocfs2: sparse b-t... |
4469 4470 4471 4472 4473 |
/* * The insert code isn't quite ready to deal with all cases of * left contiguousness. Specifically, if it's an insert into * the 1st record in a leaf, it will require the adjustment of |
e48edee2d ocfs2: make room ... |
4474 |
* cluster count on the last record of the path directly to it's |
dcd0538ff ocfs2: sparse b-t... |
4475 4476 4477 4478 4479 4480 4481 4482 4483 4484 4485 4486 4487 4488 |
* left. For now, just catch that case and fool the layers * above us. This works just fine for tree_depth == 0, which * is why we allow that above. */ if (insert->ins_contig == CONTIG_LEFT && insert->ins_contig_index == 0) insert->ins_contig = CONTIG_NONE; /* * Ok, so we can simply compare against last_eb to figure out * whether the path doesn't exist. This will only happen in * the case that we're doing a tail append, so maybe we can * take advantage of that information somehow. */ |
35dc0aa3c ocfs2: Prefix the... |
4489 |
if (ocfs2_et_get_last_eb_blk(et) == |
e7d4cb6bc ocfs2: Abstract o... |
4490 |
path_leaf_bh(path)->b_blocknr) { |
dcd0538ff ocfs2: sparse b-t... |
4491 4492 4493 4494 4495 4496 4497 4498 4499 4500 4501 4502 4503 4504 4505 4506 4507 4508 4509 |
/* * Ok, ocfs2_find_path() returned us the rightmost * tree path. This might be an appending insert. There are * two cases: * 1) We're doing a true append at the tail: * -This might even be off the end of the leaf * 2) We're "appending" by rotating in the tail */ ocfs2_figure_appending_type(insert, el, insert_rec); } out: ocfs2_free_path(path); if (ret == 0) *last_eb_bh = bh; else brelse(bh); return ret; |
ccd979bdb [PATCH] OCFS2: Th... |
4510 |
} |
dcd0538ff ocfs2: sparse b-t... |
4511 |
/* |
cc79d8c19 ocfs2: ocfs2_inse... |
4512 |
* Insert an extent into a btree. |
dcd0538ff ocfs2: sparse b-t... |
4513 |
* |
cc79d8c19 ocfs2: ocfs2_inse... |
4514 |
* The caller needs to update the owning btree's cluster count. |
dcd0538ff ocfs2: sparse b-t... |
4515 |
*/ |
cc79d8c19 ocfs2: ocfs2_inse... |
4516 |
int ocfs2_insert_extent(handle_t *handle, |
f99b9b7cc ocfs2: Make ocfs2... |
4517 4518 4519 4520 4521 4522 |
struct ocfs2_extent_tree *et, u32 cpos, u64 start_blk, u32 new_clusters, u8 flags, struct ocfs2_alloc_context *meta_ac) |
ccd979bdb [PATCH] OCFS2: Th... |
4523 |
{ |
c3afcbb34 ocfs2: abstract b... |
4524 |
int status; |
c77534f6f ocfs2: remove mos... |
4525 |
int uninitialized_var(free_records); |
ccd979bdb [PATCH] OCFS2: Th... |
4526 |
struct buffer_head *last_eb_bh = NULL; |
dcd0538ff ocfs2: sparse b-t... |
4527 4528 |
struct ocfs2_insert_type insert = {0, }; struct ocfs2_extent_rec rec; |
a09d09b8f ocfs2: Remove mlo... |
4529 4530 4531 |
trace_ocfs2_insert_extent_start( (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci), cpos, new_clusters); |
dcd0538ff ocfs2: sparse b-t... |
4532 |
|
e48edee2d ocfs2: make room ... |
4533 |
memset(&rec, 0, sizeof(rec)); |
dcd0538ff ocfs2: sparse b-t... |
4534 4535 |
rec.e_cpos = cpu_to_le32(cpos); rec.e_blkno = cpu_to_le64(start_blk); |
e48edee2d ocfs2: make room ... |
4536 |
rec.e_leaf_clusters = cpu_to_le16(new_clusters); |
2ae99a603 ocfs2: Support cr... |
4537 |
rec.e_flags = flags; |
6136ca5f5 ocfs2: Drop struc... |
4538 |
status = ocfs2_et_insert_check(et, &rec); |
1e61ee79e ocfs2: Add an ins... |
4539 4540 4541 4542 |
if (status) { mlog_errno(status); goto bail; } |
dcd0538ff ocfs2: sparse b-t... |
4543 |
|
627961b77 ocfs2: ocfs2_figu... |
4544 |
status = ocfs2_figure_insert_type(et, &last_eb_bh, &rec, |
c77534f6f ocfs2: remove mos... |
4545 |
&free_records, &insert); |
dcd0538ff ocfs2: sparse b-t... |
4546 4547 4548 |
if (status < 0) { mlog_errno(status); goto bail; |
ccd979bdb [PATCH] OCFS2: Th... |
4549 |
} |
a09d09b8f ocfs2: Remove mlo... |
4550 4551 4552 |
trace_ocfs2_insert_extent(insert.ins_appending, insert.ins_contig, insert.ins_contig_index, free_records, insert.ins_tree_depth); |
ccd979bdb [PATCH] OCFS2: Th... |
4553 |
|
c77534f6f ocfs2: remove mos... |
4554 |
if (insert.ins_contig == CONTIG_NONE && free_records == 0) { |
d401dc12f ocfs2: ocfs2_grow... |
4555 |
status = ocfs2_grow_tree(handle, et, |
328d5752e ocfs2: btree chan... |
4556 |
&insert.ins_tree_depth, &last_eb_bh, |
c3afcbb34 ocfs2: abstract b... |
4557 4558 |
meta_ac); if (status) { |
ccd979bdb [PATCH] OCFS2: Th... |
4559 4560 4561 |
mlog_errno(status); goto bail; } |
ccd979bdb [PATCH] OCFS2: Th... |
4562 |
} |
dcd0538ff ocfs2: sparse b-t... |
4563 |
/* Finally, we can add clusters. This might rotate the tree for us. */ |
3505bec01 ocfs2: ocfs2_do_i... |
4564 |
status = ocfs2_do_insert_extent(handle, et, &rec, &insert); |
ccd979bdb [PATCH] OCFS2: Th... |
4565 4566 |
if (status < 0) mlog_errno(status); |
92ba470c4 ocfs2: Make exten... |
4567 4568 |
else ocfs2_et_extent_map_insert(et, &rec); |
ccd979bdb [PATCH] OCFS2: Th... |
4569 4570 |
bail: |
a81cb88b6 ocfs2: Don't chec... |
4571 |
brelse(last_eb_bh); |
ccd979bdb [PATCH] OCFS2: Th... |
4572 |
|
f56654c43 ocfs2: Add extent... |
4573 4574 |
return status; } |
0eb8d47e6 ocfs2: Make high ... |
4575 4576 4577 |
/* * Allcate and add clusters into the extent b-tree. * The new clusters(clusters_to_add) will be inserted at logical_offset. |
f99b9b7cc ocfs2: Make ocfs2... |
4578 |
* The extent b-tree's root is specified by et, and |
0eb8d47e6 ocfs2: Make high ... |
4579 4580 4581 |
* it is not limited to the file storage. Any extent tree can use this * function if it implements the proper ocfs2_extent_tree. */ |
cbee7e1a6 ocfs2: ocfs2_add_... |
4582 4583 |
int ocfs2_add_clusters_in_btree(handle_t *handle, struct ocfs2_extent_tree *et, |
0eb8d47e6 ocfs2: Make high ... |
4584 4585 4586 |
u32 *logical_offset, u32 clusters_to_add, int mark_unwritten, |
0eb8d47e6 ocfs2: Make high ... |
4587 4588 |
struct ocfs2_alloc_context *data_ac, struct ocfs2_alloc_context *meta_ac, |
f99b9b7cc ocfs2: Make ocfs2... |
4589 |
enum ocfs2_alloc_restarted *reason_ret) |
0eb8d47e6 ocfs2: Make high ... |
4590 |
{ |
a09d09b8f ocfs2: Remove mlo... |
4591 |
int status = 0, err = 0; |
fb951eb5e ocfs2: free alloc... |
4592 |
int need_free = 0; |
0eb8d47e6 ocfs2: Make high ... |
4593 4594 4595 4596 4597 |
int free_extents; enum ocfs2_alloc_restarted reason = RESTART_NONE; u32 bit_off, num_bits; u64 block; u8 flags = 0; |
cbee7e1a6 ocfs2: ocfs2_add_... |
4598 4599 |
struct ocfs2_super *osb = OCFS2_SB(ocfs2_metadata_cache_get_super(et->et_ci)); |
0eb8d47e6 ocfs2: Make high ... |
4600 4601 4602 4603 4604 |
BUG_ON(!clusters_to_add); if (mark_unwritten) flags = OCFS2_EXT_UNWRITTEN; |
964f14a0d ocfs2: clean up s... |
4605 |
free_extents = ocfs2_num_free_extents(et); |
0eb8d47e6 ocfs2: Make high ... |
4606 4607 4608 4609 4610 4611 4612 4613 4614 4615 4616 4617 |
if (free_extents < 0) { status = free_extents; mlog_errno(status); goto leave; } /* there are two cases which could cause us to EAGAIN in the * we-need-more-metadata case: * 1) we haven't reserved *any* * 2) we are so fragmented, we've needed to add metadata too * many times. */ if (!free_extents && !meta_ac) { |
a09d09b8f ocfs2: Remove mlo... |
4618 |
err = -1; |
0eb8d47e6 ocfs2: Make high ... |
4619 4620 4621 4622 4623 |
status = -EAGAIN; reason = RESTART_META; goto leave; } else if ((!free_extents) && (ocfs2_alloc_context_bits_left(meta_ac) |
f99b9b7cc ocfs2: Make ocfs2... |
4624 |
< ocfs2_extend_meta_needed(et->et_root_el))) { |
a09d09b8f ocfs2: Remove mlo... |
4625 |
err = -2; |
0eb8d47e6 ocfs2: Make high ... |
4626 4627 4628 4629 |
status = -EAGAIN; reason = RESTART_META; goto leave; } |
1ed9b777f ocfs2: ocfs2_clai... |
4630 |
status = __ocfs2_claim_clusters(handle, data_ac, 1, |
0eb8d47e6 ocfs2: Make high ... |
4631 4632 4633 4634 4635 4636 4637 4638 |
clusters_to_add, &bit_off, &num_bits); if (status < 0) { if (status != -ENOSPC) mlog_errno(status); goto leave; } BUG_ON(num_bits > clusters_to_add); |
13723d00e ocfs2: Use metada... |
4639 |
/* reserve our write early -- insert_extent may update the tree root */ |
d9a0a1f83 ocfs2: Store the ... |
4640 |
status = ocfs2_et_root_journal_access(handle, et, |
13723d00e ocfs2: Use metada... |
4641 |
OCFS2_JOURNAL_ACCESS_WRITE); |
0eb8d47e6 ocfs2: Make high ... |
4642 4643 |
if (status < 0) { mlog_errno(status); |
fb951eb5e ocfs2: free alloc... |
4644 4645 |
need_free = 1; goto bail; |
0eb8d47e6 ocfs2: Make high ... |
4646 4647 4648 |
} block = ocfs2_clusters_to_blocks(osb->sb, bit_off); |
a09d09b8f ocfs2: Remove mlo... |
4649 4650 4651 |
trace_ocfs2_add_clusters_in_btree( (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci), bit_off, num_bits); |
cc79d8c19 ocfs2: ocfs2_inse... |
4652 |
status = ocfs2_insert_extent(handle, et, *logical_offset, block, |
f99b9b7cc ocfs2: Make ocfs2... |
4653 |
num_bits, flags, meta_ac); |
0eb8d47e6 ocfs2: Make high ... |
4654 4655 |
if (status < 0) { mlog_errno(status); |
fb951eb5e ocfs2: free alloc... |
4656 4657 |
need_free = 1; goto bail; |
0eb8d47e6 ocfs2: Make high ... |
4658 |
} |
ec20cec7a ocfs2: Make ocfs2... |
4659 |
ocfs2_journal_dirty(handle, et->et_root_bh); |
0eb8d47e6 ocfs2: Make high ... |
4660 4661 4662 4663 4664 |
clusters_to_add -= num_bits; *logical_offset += num_bits; if (clusters_to_add) { |
a09d09b8f ocfs2: Remove mlo... |
4665 |
err = clusters_to_add; |
0eb8d47e6 ocfs2: Make high ... |
4666 4667 4668 |
status = -EAGAIN; reason = RESTART_TRANS; } |
fb951eb5e ocfs2: free alloc... |
4669 4670 4671 4672 4673 4674 4675 4676 4677 4678 4679 4680 |
bail: if (need_free) { if (data_ac->ac_which == OCFS2_AC_USE_LOCAL) ocfs2_free_local_alloc_bits(osb, handle, data_ac, bit_off, num_bits); else ocfs2_free_clusters(handle, data_ac->ac_inode, data_ac->ac_bh, ocfs2_clusters_to_blocks(osb->sb, bit_off), num_bits); } |
0eb8d47e6 ocfs2: Make high ... |
4681 |
leave: |
0eb8d47e6 ocfs2: Make high ... |
4682 4683 |
if (reason_ret) *reason_ret = reason; |
a09d09b8f ocfs2: Remove mlo... |
4684 |
trace_ocfs2_add_clusters_in_btree_ret(status, reason, err); |
0eb8d47e6 ocfs2: Make high ... |
4685 4686 |
return status; } |
328d5752e ocfs2: btree chan... |
4687 4688 4689 4690 4691 4692 4693 4694 4695 4696 4697 4698 4699 4700 4701 4702 4703 4704 4705 |
static void ocfs2_make_right_split_rec(struct super_block *sb, struct ocfs2_extent_rec *split_rec, u32 cpos, struct ocfs2_extent_rec *rec) { u32 rec_cpos = le32_to_cpu(rec->e_cpos); u32 rec_range = rec_cpos + le16_to_cpu(rec->e_leaf_clusters); memset(split_rec, 0, sizeof(struct ocfs2_extent_rec)); split_rec->e_cpos = cpu_to_le32(cpos); split_rec->e_leaf_clusters = cpu_to_le16(rec_range - cpos); split_rec->e_blkno = rec->e_blkno; le64_add_cpu(&split_rec->e_blkno, ocfs2_clusters_to_blocks(sb, cpos - rec_cpos)); split_rec->e_flags = rec->e_flags; } |
d231129f4 ocfs2: ocfs2_spli... |
4706 |
static int ocfs2_split_and_insert(handle_t *handle, |
e7d4cb6bc ocfs2: Abstract o... |
4707 |
struct ocfs2_extent_tree *et, |
d231129f4 ocfs2: ocfs2_spli... |
4708 |
struct ocfs2_path *path, |
328d5752e ocfs2: btree chan... |
4709 4710 4711 4712 4713 4714 4715 4716 4717 4718 4719 4720 4721 |
struct buffer_head **last_eb_bh, int split_index, struct ocfs2_extent_rec *orig_split_rec, struct ocfs2_alloc_context *meta_ac) { int ret = 0, depth; unsigned int insert_range, rec_range, do_leftright = 0; struct ocfs2_extent_rec tmprec; struct ocfs2_extent_list *rightmost_el; struct ocfs2_extent_rec rec; struct ocfs2_extent_rec split_rec = *orig_split_rec; struct ocfs2_insert_type insert; struct ocfs2_extent_block *eb; |
328d5752e ocfs2: btree chan... |
4722 4723 4724 4725 4726 4727 4728 |
leftright: /* * Store a copy of the record on the stack - it might move * around as the tree is manipulated below. */ rec = path_leaf_el(path)->l_recs[split_index]; |
ce1d9ea62 ocfs2: Prefix the... |
4729 |
rightmost_el = et->et_root_el; |
328d5752e ocfs2: btree chan... |
4730 4731 4732 4733 4734 4735 4736 4737 4738 4739 |
depth = le16_to_cpu(rightmost_el->l_tree_depth); if (depth) { BUG_ON(!(*last_eb_bh)); eb = (struct ocfs2_extent_block *) (*last_eb_bh)->b_data; rightmost_el = &eb->h_list; } if (le16_to_cpu(rightmost_el->l_next_free_rec) == le16_to_cpu(rightmost_el->l_count)) { |
d401dc12f ocfs2: ocfs2_grow... |
4740 |
ret = ocfs2_grow_tree(handle, et, |
e7d4cb6bc ocfs2: Abstract o... |
4741 |
&depth, last_eb_bh, meta_ac); |
328d5752e ocfs2: btree chan... |
4742 4743 4744 4745 |
if (ret) { mlog_errno(ret); goto out; } |
328d5752e ocfs2: btree chan... |
4746 4747 4748 4749 4750 |
} memset(&insert, 0, sizeof(struct ocfs2_insert_type)); insert.ins_appending = APPEND_NONE; insert.ins_contig = CONTIG_NONE; |
328d5752e ocfs2: btree chan... |
4751 4752 4753 4754 4755 4756 4757 4758 4759 4760 4761 4762 4763 4764 4765 4766 4767 |
insert.ins_tree_depth = depth; insert_range = le32_to_cpu(split_rec.e_cpos) + le16_to_cpu(split_rec.e_leaf_clusters); rec_range = le32_to_cpu(rec.e_cpos) + le16_to_cpu(rec.e_leaf_clusters); if (split_rec.e_cpos == rec.e_cpos) { insert.ins_split = SPLIT_LEFT; } else if (insert_range == rec_range) { insert.ins_split = SPLIT_RIGHT; } else { /* * Left/right split. We fake this as a right split * first and then make a second pass as a left split. */ insert.ins_split = SPLIT_RIGHT; |
d231129f4 ocfs2: ocfs2_spli... |
4768 4769 |
ocfs2_make_right_split_rec(ocfs2_metadata_cache_get_super(et->et_ci), &tmprec, insert_range, &rec); |
328d5752e ocfs2: btree chan... |
4770 4771 4772 4773 4774 4775 |
split_rec = tmprec; BUG_ON(do_leftright); do_leftright = 1; } |
3505bec01 ocfs2: ocfs2_do_i... |
4776 |
ret = ocfs2_do_insert_extent(handle, et, &split_rec, &insert); |
328d5752e ocfs2: btree chan... |
4777 4778 4779 4780 4781 4782 4783 4784 4785 4786 4787 4788 4789 4790 4791 |
if (ret) { mlog_errno(ret); goto out; } if (do_leftright == 1) { u32 cpos; struct ocfs2_extent_list *el; do_leftright++; split_rec = *orig_split_rec; ocfs2_reinit_path(path, 1); cpos = le32_to_cpu(split_rec.e_cpos); |
facdb77f5 ocfs2: ocfs2_find... |
4792 |
ret = ocfs2_find_path(et->et_ci, path, cpos); |
328d5752e ocfs2: btree chan... |
4793 4794 4795 4796 4797 4798 4799 |
if (ret) { mlog_errno(ret); goto out; } el = path_leaf_el(path); split_index = ocfs2_search_extent_list(el, cpos); |
981035b47 ocfs2: correctly ... |
4800 4801 |
if (split_index == -1) { ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci), |
7ecef14ab ocfs2: neaten do_... |
4802 4803 4804 4805 |
"Owner %llu has an extent at cpos %u which can no longer be found ", (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci), cpos); |
981035b47 ocfs2: correctly ... |
4806 4807 4808 |
ret = -EROFS; goto out; } |
328d5752e ocfs2: btree chan... |
4809 4810 4811 4812 4813 4814 |
goto leftright; } out: return ret; } |
f3868d0fa ocfs2: Teach ocfs... |
4815 4816 |
static int ocfs2_replace_extent_rec(handle_t *handle, struct ocfs2_extent_tree *et, |
47be12e4e ocfs2: Access and... |
4817 4818 4819 4820 4821 4822 |
struct ocfs2_path *path, struct ocfs2_extent_list *el, int split_index, struct ocfs2_extent_rec *split_rec) { int ret; |
f3868d0fa ocfs2: Teach ocfs... |
4823 |
ret = ocfs2_path_bh_journal_access(handle, et->et_ci, path, |
47be12e4e ocfs2: Access and... |
4824 4825 4826 4827 4828 4829 4830 4831 4832 4833 4834 4835 |
path_num_items(path) - 1); if (ret) { mlog_errno(ret); goto out; } el->l_recs[split_index] = *split_rec; ocfs2_journal_dirty(handle, path_leaf_bh(path)); out: return ret; } |
328d5752e ocfs2: btree chan... |
4836 |
/* |
555936bfc ocfs2: Abstract e... |
4837 4838 |
* Split part or all of the extent record at split_index in the leaf * pointed to by path. Merge with the contiguous extent record if needed. |
328d5752e ocfs2: btree chan... |
4839 4840 4841 4842 4843 4844 4845 |
* * Care is taken to handle contiguousness so as to not grow the tree. * * meta_ac is not strictly necessary - we only truly need it if growth * of the tree is required. All other cases will degrade into a less * optimal tree layout. * |
e7d4cb6bc ocfs2: Abstract o... |
4846 4847 4848 |
* last_eb_bh should be the rightmost leaf block for any extent * btree. Since a split may grow the tree or a merge might shrink it, * the caller cannot trust the contents of that buffer after this call. |
328d5752e ocfs2: btree chan... |
4849 4850 4851 4852 4853 4854 |
* * This code is optimized for readability - several passes might be * made over certain portions of the tree. All of those blocks will * have been brought into cache (and pinned via the journal), so the * extra overhead is not expressed in terms of disk reads. */ |
e2e9f6082 ocfs2: move tree ... |
4855 4856 4857 4858 4859 4860 4861 |
int ocfs2_split_extent(handle_t *handle, struct ocfs2_extent_tree *et, struct ocfs2_path *path, int split_index, struct ocfs2_extent_rec *split_rec, struct ocfs2_alloc_context *meta_ac, struct ocfs2_cached_dealloc_ctxt *dealloc) |
328d5752e ocfs2: btree chan... |
4862 4863 4864 |
{ int ret = 0; struct ocfs2_extent_list *el = path_leaf_el(path); |
e8aed3450 ocfs2: Re-journal... |
4865 |
struct buffer_head *last_eb_bh = NULL; |
328d5752e ocfs2: btree chan... |
4866 4867 4868 |
struct ocfs2_extent_rec *rec = &el->l_recs[split_index]; struct ocfs2_merge_ctxt ctxt; struct ocfs2_extent_list *rightmost_el; |
328d5752e ocfs2: btree chan... |
4869 4870 4871 4872 4873 4874 4875 |
if (le32_to_cpu(rec->e_cpos) > le32_to_cpu(split_rec->e_cpos) || ((le32_to_cpu(rec->e_cpos) + le16_to_cpu(rec->e_leaf_clusters)) < (le32_to_cpu(split_rec->e_cpos) + le16_to_cpu(split_rec->e_leaf_clusters)))) { ret = -EIO; mlog_errno(ret); goto out; } |
9f99ad086 ocfs2: return err... |
4876 4877 4878 4879 4880 4881 4882 4883 |
ret = ocfs2_figure_merge_contig_type(et, path, el, split_index, split_rec, &ctxt); if (ret) { mlog_errno(ret); goto out; } |
328d5752e ocfs2: btree chan... |
4884 4885 4886 |
/* * The core merge / split code wants to know how much room is |
a1cf076ba ocfs2: __ocfs2_ma... |
4887 |
* left in this allocation tree, so we pass the |
328d5752e ocfs2: btree chan... |
4888 4889 4890 4891 |
* rightmost extent list. */ if (path->p_tree_depth) { struct ocfs2_extent_block *eb; |
328d5752e ocfs2: btree chan... |
4892 |
|
3d03a305d ocfs2: Pass ocfs2... |
4893 |
ret = ocfs2_read_extent_block(et->et_ci, |
5e96581a3 ocfs2: Wrap exten... |
4894 4895 |
ocfs2_et_get_last_eb_blk(et), &last_eb_bh); |
328d5752e ocfs2: btree chan... |
4896 |
if (ret) { |
c1e8d35ef ocfs2: Remove EXI... |
4897 |
mlog_errno(ret); |
328d5752e ocfs2: btree chan... |
4898 4899 4900 4901 |
goto out; } eb = (struct ocfs2_extent_block *) last_eb_bh->b_data; |
328d5752e ocfs2: btree chan... |
4902 4903 4904 |
rightmost_el = &eb->h_list; } else rightmost_el = path_root_el(path); |
328d5752e ocfs2: btree chan... |
4905 4906 4907 4908 4909 4910 4911 |
if (rec->e_cpos == split_rec->e_cpos && rec->e_leaf_clusters == split_rec->e_leaf_clusters) ctxt.c_split_covers_rec = 1; else ctxt.c_split_covers_rec = 0; ctxt.c_has_empty_extent = ocfs2_is_empty_extent(&el->l_recs[0]); |
a09d09b8f ocfs2: Remove mlo... |
4912 4913 4914 |
trace_ocfs2_split_extent(split_index, ctxt.c_contig_type, ctxt.c_has_empty_extent, ctxt.c_split_covers_rec); |
328d5752e ocfs2: btree chan... |
4915 4916 4917 |
if (ctxt.c_contig_type == CONTIG_NONE) { if (ctxt.c_split_covers_rec) |
f3868d0fa ocfs2: Teach ocfs... |
4918 |
ret = ocfs2_replace_extent_rec(handle, et, path, el, |
47be12e4e ocfs2: Access and... |
4919 |
split_index, split_rec); |
328d5752e ocfs2: btree chan... |
4920 |
else |
d231129f4 ocfs2: ocfs2_spli... |
4921 |
ret = ocfs2_split_and_insert(handle, et, path, |
328d5752e ocfs2: btree chan... |
4922 4923 4924 4925 4926 |
&last_eb_bh, split_index, split_rec, meta_ac); if (ret) mlog_errno(ret); } else { |
c495dd24a ocfs2: ocfs2_try_... |
4927 |
ret = ocfs2_try_to_merge_extent(handle, et, path, |
328d5752e ocfs2: btree chan... |
4928 |
split_index, split_rec, |
c495dd24a ocfs2: ocfs2_try_... |
4929 |
dealloc, &ctxt); |
328d5752e ocfs2: btree chan... |
4930 4931 4932 |
if (ret) mlog_errno(ret); } |
328d5752e ocfs2: btree chan... |
4933 4934 4935 4936 4937 4938 |
out: brelse(last_eb_bh); return ret; } /* |
555936bfc ocfs2: Abstract e... |
4939 4940 4941 4942 4943 |
* Change the flags of the already-existing extent at cpos for len clusters. * * new_flags: the flags we want to set. * clear_flags: the flags we want to clear. * phys: the new physical offset we want this new extent starts from. |
328d5752e ocfs2: btree chan... |
4944 4945 4946 4947 4948 4949 |
* * If the existing extent is larger than the request, initiate a * split. An attempt will be made at merging with adjacent extents. * * The caller is responsible for passing down meta_ac if we'll need it. */ |
1aa75fea6 ocfs2: Add functi... |
4950 4951 4952 4953 4954 4955 |
int ocfs2_change_extent_flag(handle_t *handle, struct ocfs2_extent_tree *et, u32 cpos, u32 len, u32 phys, struct ocfs2_alloc_context *meta_ac, struct ocfs2_cached_dealloc_ctxt *dealloc, int new_flags, int clear_flags) |
328d5752e ocfs2: btree chan... |
4956 4957 |
{ int ret, index; |
555936bfc ocfs2: Abstract e... |
4958 4959 |
struct super_block *sb = ocfs2_metadata_cache_get_super(et->et_ci); u64 start_blkno = ocfs2_clusters_to_blocks(sb, phys); |
328d5752e ocfs2: btree chan... |
4960 4961 4962 |
struct ocfs2_extent_rec split_rec; struct ocfs2_path *left_path = NULL; struct ocfs2_extent_list *el; |
555936bfc ocfs2: Abstract e... |
4963 |
struct ocfs2_extent_rec *rec; |
328d5752e ocfs2: btree chan... |
4964 |
|
ffdd7a546 ocfs2: Wrap up th... |
4965 |
left_path = ocfs2_new_path_from_et(et); |
328d5752e ocfs2: btree chan... |
4966 4967 4968 4969 4970 |
if (!left_path) { ret = -ENOMEM; mlog_errno(ret); goto out; } |
facdb77f5 ocfs2: ocfs2_find... |
4971 |
ret = ocfs2_find_path(et->et_ci, left_path, cpos); |
328d5752e ocfs2: btree chan... |
4972 4973 4974 4975 4976 4977 4978 |
if (ret) { mlog_errno(ret); goto out; } el = path_leaf_el(left_path); index = ocfs2_search_extent_list(el, cpos); |
981035b47 ocfs2: correctly ... |
4979 |
if (index == -1) { |
555936bfc ocfs2: Abstract e... |
4980 |
ocfs2_error(sb, |
7ecef14ab ocfs2: neaten do_... |
4981 4982 4983 4984 |
"Owner %llu has an extent at cpos %u which can no longer be found ", (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci), cpos); |
328d5752e ocfs2: btree chan... |
4985 4986 4987 |
ret = -EROFS; goto out; } |
555936bfc ocfs2: Abstract e... |
4988 4989 4990 4991 |
ret = -EIO; rec = &el->l_recs[index]; if (new_flags && (rec->e_flags & new_flags)) { mlog(ML_ERROR, "Owner %llu tried to set %d flags on an " |
86544fbd8 ocfs2: add newlin... |
4992 4993 |
"extent that already had them ", |
555936bfc ocfs2: Abstract e... |
4994 4995 4996 4997 4998 4999 5000 |
(unsigned long long)ocfs2_metadata_cache_owner(et->et_ci), new_flags); goto out; } if (clear_flags && !(rec->e_flags & clear_flags)) { mlog(ML_ERROR, "Owner %llu tried to clear %d flags on an " |
86544fbd8 ocfs2: add newlin... |
5001 5002 |
"extent that didn't have them ", |
555936bfc ocfs2: Abstract e... |
5003 5004 5005 5006 |
(unsigned long long)ocfs2_metadata_cache_owner(et->et_ci), clear_flags); goto out; } |
328d5752e ocfs2: btree chan... |
5007 5008 5009 5010 |
memset(&split_rec, 0, sizeof(struct ocfs2_extent_rec)); split_rec.e_cpos = cpu_to_le32(cpos); split_rec.e_leaf_clusters = cpu_to_le16(len); split_rec.e_blkno = cpu_to_le64(start_blkno); |
555936bfc ocfs2: Abstract e... |
5011 5012 5013 5014 5015 |
split_rec.e_flags = rec->e_flags; if (new_flags) split_rec.e_flags |= new_flags; if (clear_flags) split_rec.e_flags &= ~clear_flags; |
e2e9f6082 ocfs2: move tree ... |
5016 5017 5018 |
ret = ocfs2_split_extent(handle, et, left_path, index, &split_rec, meta_ac, dealloc); |
328d5752e ocfs2: btree chan... |
5019 5020 5021 5022 5023 5024 |
if (ret) mlog_errno(ret); out: ocfs2_free_path(left_path); return ret; |
555936bfc ocfs2: Abstract e... |
5025 5026 5027 5028 5029 5030 5031 5032 5033 5034 5035 5036 5037 5038 5039 5040 5041 5042 5043 |
} /* * Mark the already-existing extent at cpos as written for len clusters. * This removes the unwritten extent flag. * * If the existing extent is larger than the request, initiate a * split. An attempt will be made at merging with adjacent extents. * * The caller is responsible for passing down meta_ac if we'll need it. */ int ocfs2_mark_extent_written(struct inode *inode, struct ocfs2_extent_tree *et, handle_t *handle, u32 cpos, u32 len, u32 phys, struct ocfs2_alloc_context *meta_ac, struct ocfs2_cached_dealloc_ctxt *dealloc) { int ret; |
a09d09b8f ocfs2: Remove mlo... |
5044 5045 5046 |
trace_ocfs2_mark_extent_written( (unsigned long long)OCFS2_I(inode)->ip_blkno, cpos, len, phys); |
555936bfc ocfs2: Abstract e... |
5047 5048 |
if (!ocfs2_writes_unwritten_extents(OCFS2_SB(inode->i_sb))) { |
7ecef14ab ocfs2: neaten do_... |
5049 5050 |
ocfs2_error(inode->i_sb, "Inode %llu has unwritten extents that are being written to, but the feature bit is not set in the super block ", |
555936bfc ocfs2: Abstract e... |
5051 5052 5053 5054 5055 5056 5057 5058 5059 5060 5061 5062 5063 5064 5065 5066 5067 5068 5069 |
(unsigned long long)OCFS2_I(inode)->ip_blkno); ret = -EROFS; goto out; } /* * XXX: This should be fixed up so that we just re-insert the * next extent records. */ ocfs2_et_extent_map_truncate(et, 0); ret = ocfs2_change_extent_flag(handle, et, cpos, len, phys, meta_ac, dealloc, 0, OCFS2_EXT_UNWRITTEN); if (ret) mlog_errno(ret); out: return ret; |
328d5752e ocfs2: btree chan... |
5070 |
} |
dbdcf6a48 ocfs2: ocfs2_remo... |
5071 5072 |
static int ocfs2_split_tree(handle_t *handle, struct ocfs2_extent_tree *et, struct ocfs2_path *path, |
d0c7d7082 ocfs2: btree supp... |
5073 5074 5075 |
int index, u32 new_range, struct ocfs2_alloc_context *meta_ac) { |
c901fb007 ocfs2: Make ocfs2... |
5076 |
int ret, depth, credits; |
d0c7d7082 ocfs2: btree supp... |
5077 5078 5079 5080 5081 5082 5083 5084 5085 5086 5087 5088 |
struct buffer_head *last_eb_bh = NULL; struct ocfs2_extent_block *eb; struct ocfs2_extent_list *rightmost_el, *el; struct ocfs2_extent_rec split_rec; struct ocfs2_extent_rec *rec; struct ocfs2_insert_type insert; /* * Setup the record to split before we grow the tree. */ el = path_leaf_el(path); rec = &el->l_recs[index]; |
dbdcf6a48 ocfs2: ocfs2_remo... |
5089 5090 |
ocfs2_make_right_split_rec(ocfs2_metadata_cache_get_super(et->et_ci), &split_rec, new_range, rec); |
d0c7d7082 ocfs2: btree supp... |
5091 5092 5093 |
depth = path->p_tree_depth; if (depth > 0) { |
3d03a305d ocfs2: Pass ocfs2... |
5094 |
ret = ocfs2_read_extent_block(et->et_ci, |
5e96581a3 ocfs2: Wrap exten... |
5095 5096 |
ocfs2_et_get_last_eb_blk(et), &last_eb_bh); |
d0c7d7082 ocfs2: btree supp... |
5097 5098 5099 5100 5101 5102 5103 5104 5105 |
if (ret < 0) { mlog_errno(ret); goto out; } eb = (struct ocfs2_extent_block *) last_eb_bh->b_data; rightmost_el = &eb->h_list; } else rightmost_el = path_leaf_el(path); |
c901fb007 ocfs2: Make ocfs2... |
5106 5107 |
credits = path->p_tree_depth + ocfs2_extend_meta_needed(et->et_root_el); |
d0c7d7082 ocfs2: btree supp... |
5108 5109 5110 5111 5112 5113 5114 5115 |
ret = ocfs2_extend_trans(handle, credits); if (ret) { mlog_errno(ret); goto out; } if (le16_to_cpu(rightmost_el->l_next_free_rec) == le16_to_cpu(rightmost_el->l_count)) { |
d401dc12f ocfs2: ocfs2_grow... |
5116 |
ret = ocfs2_grow_tree(handle, et, &depth, &last_eb_bh, |
d0c7d7082 ocfs2: btree supp... |
5117 5118 5119 5120 5121 |
meta_ac); if (ret) { mlog_errno(ret); goto out; } |
d0c7d7082 ocfs2: btree supp... |
5122 5123 5124 5125 5126 5127 |
} memset(&insert, 0, sizeof(struct ocfs2_insert_type)); insert.ins_appending = APPEND_NONE; insert.ins_contig = CONTIG_NONE; insert.ins_split = SPLIT_RIGHT; |
d0c7d7082 ocfs2: btree supp... |
5128 |
insert.ins_tree_depth = depth; |
3505bec01 ocfs2: ocfs2_do_i... |
5129 |
ret = ocfs2_do_insert_extent(handle, et, &split_rec, &insert); |
d0c7d7082 ocfs2: btree supp... |
5130 5131 5132 5133 5134 5135 5136 |
if (ret) mlog_errno(ret); out: brelse(last_eb_bh); return ret; } |
043beebb6 ocfs2: ocfs2_trun... |
5137 5138 |
static int ocfs2_truncate_rec(handle_t *handle, struct ocfs2_extent_tree *et, |
d0c7d7082 ocfs2: btree supp... |
5139 5140 |
struct ocfs2_path *path, int index, struct ocfs2_cached_dealloc_ctxt *dealloc, |
043beebb6 ocfs2: ocfs2_trun... |
5141 |
u32 cpos, u32 len) |
d0c7d7082 ocfs2: btree supp... |
5142 5143 5144 |
{ int ret; u32 left_cpos, rec_range, trunc_range; |
c14688ea2 ocfs2: clean up a... |
5145 |
int is_rightmost_tree_rec = 0; |
043beebb6 ocfs2: ocfs2_trun... |
5146 |
struct super_block *sb = ocfs2_metadata_cache_get_super(et->et_ci); |
d0c7d7082 ocfs2: btree supp... |
5147 5148 5149 5150 5151 5152 |
struct ocfs2_path *left_path = NULL; struct ocfs2_extent_list *el = path_leaf_el(path); struct ocfs2_extent_rec *rec; struct ocfs2_extent_block *eb; if (ocfs2_is_empty_extent(&el->l_recs[0]) && index > 0) { |
172159898 ocfs2: extend tra... |
5153 5154 5155 5156 5157 5158 5159 5160 |
/* extend credit for ocfs2_remove_rightmost_path */ ret = ocfs2_extend_rotate_transaction(handle, 0, handle->h_buffer_credits, path); if (ret) { mlog_errno(ret); goto out; } |
70f18c08b ocfs2: ocfs2_rota... |
5161 |
ret = ocfs2_rotate_tree_left(handle, et, path, dealloc); |
d0c7d7082 ocfs2: btree supp... |
5162 5163 5164 5165 5166 5167 5168 5169 5170 5171 5172 5173 5174 5175 5176 5177 5178 5179 5180 5181 5182 5183 5184 5185 5186 5187 5188 5189 5190 5191 5192 |
if (ret) { mlog_errno(ret); goto out; } index--; } if (index == (le16_to_cpu(el->l_next_free_rec) - 1) && path->p_tree_depth) { /* * Check whether this is the rightmost tree record. If * we remove all of this record or part of its right * edge then an update of the record lengths above it * will be required. */ eb = (struct ocfs2_extent_block *)path_leaf_bh(path)->b_data; if (eb->h_next_leaf_blk == 0) is_rightmost_tree_rec = 1; } rec = &el->l_recs[index]; if (index == 0 && path->p_tree_depth && le32_to_cpu(rec->e_cpos) == cpos) { /* * Changing the leftmost offset (via partial or whole * record truncate) of an interior (or rightmost) path * means we have to update the subtree that is formed * by this leaf and the one to it's left. * * There are two cases we can skip: |
043beebb6 ocfs2: ocfs2_trun... |
5193 |
* 1) Path is the leftmost one in our btree. |
d0c7d7082 ocfs2: btree supp... |
5194 5195 5196 5197 |
* 2) The leaf is rightmost and will be empty after * we remove the extent record - the rotate code * knows how to update the newly formed edge. */ |
043beebb6 ocfs2: ocfs2_trun... |
5198 |
ret = ocfs2_find_cpos_for_left_leaf(sb, path, &left_cpos); |
d0c7d7082 ocfs2: btree supp... |
5199 5200 5201 5202 5203 5204 |
if (ret) { mlog_errno(ret); goto out; } if (left_cpos && le16_to_cpu(el->l_next_free_rec) > 1) { |
ffdd7a546 ocfs2: Wrap up th... |
5205 |
left_path = ocfs2_new_path_from_path(path); |
d0c7d7082 ocfs2: btree supp... |
5206 5207 5208 5209 5210 |
if (!left_path) { ret = -ENOMEM; mlog_errno(ret); goto out; } |
facdb77f5 ocfs2: ocfs2_find... |
5211 5212 |
ret = ocfs2_find_path(et->et_ci, left_path, left_cpos); |
d0c7d7082 ocfs2: btree supp... |
5213 5214 5215 5216 5217 5218 5219 5220 5221 5222 5223 5224 5225 5226 |
if (ret) { mlog_errno(ret); goto out; } } } ret = ocfs2_extend_rotate_transaction(handle, 0, handle->h_buffer_credits, path); if (ret) { mlog_errno(ret); goto out; } |
d9a0a1f83 ocfs2: Store the ... |
5227 |
ret = ocfs2_journal_access_path(et->et_ci, handle, path); |
d0c7d7082 ocfs2: btree supp... |
5228 5229 5230 5231 |
if (ret) { mlog_errno(ret); goto out; } |
d9a0a1f83 ocfs2: Store the ... |
5232 |
ret = ocfs2_journal_access_path(et->et_ci, handle, left_path); |
d0c7d7082 ocfs2: btree supp... |
5233 5234 5235 5236 5237 5238 5239 5240 5241 5242 5243 5244 5245 |
if (ret) { mlog_errno(ret); goto out; } rec_range = le32_to_cpu(rec->e_cpos) + ocfs2_rec_clusters(el, rec); trunc_range = cpos + len; if (le32_to_cpu(rec->e_cpos) == cpos && rec_range == trunc_range) { int next_free; memset(rec, 0, sizeof(*rec)); ocfs2_cleanup_merge(el, index); |
d0c7d7082 ocfs2: btree supp... |
5246 5247 5248 5249 5250 5251 5252 5253 |
next_free = le16_to_cpu(el->l_next_free_rec); if (is_rightmost_tree_rec && next_free > 1) { /* * We skip the edge update if this path will * be deleted by the rotate code. */ rec = &el->l_recs[next_free - 1]; |
d401dc12f ocfs2: ocfs2_grow... |
5254 |
ocfs2_adjust_rightmost_records(handle, et, path, |
d0c7d7082 ocfs2: btree supp... |
5255 5256 5257 5258 5259 5260 5261 5262 5263 5264 5265 |
rec); } } else if (le32_to_cpu(rec->e_cpos) == cpos) { /* Remove leftmost portion of the record. */ le32_add_cpu(&rec->e_cpos, len); le64_add_cpu(&rec->e_blkno, ocfs2_clusters_to_blocks(sb, len)); le16_add_cpu(&rec->e_leaf_clusters, -len); } else if (rec_range == trunc_range) { /* Remove rightmost portion of the record */ le16_add_cpu(&rec->e_leaf_clusters, -len); if (is_rightmost_tree_rec) |
d401dc12f ocfs2: ocfs2_grow... |
5266 |
ocfs2_adjust_rightmost_records(handle, et, path, rec); |
d0c7d7082 ocfs2: btree supp... |
5267 5268 |
} else { /* Caller should have trapped this. */ |
043beebb6 ocfs2: ocfs2_trun... |
5269 5270 5271 5272 |
mlog(ML_ERROR, "Owner %llu: Invalid record truncate: (%u, %u) " "(%u, %u) ", (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci), |
d0c7d7082 ocfs2: btree supp... |
5273 5274 5275 5276 5277 5278 5279 |
le32_to_cpu(rec->e_cpos), le16_to_cpu(rec->e_leaf_clusters), cpos, len); BUG(); } if (left_path) { int subtree_index; |
7dc028056 ocfs2: Pass ocfs2... |
5280 |
subtree_index = ocfs2_find_subtree_root(et, left_path, path); |
4619c73e7 ocfs2: ocfs2_comp... |
5281 |
ocfs2_complete_edge_insert(handle, left_path, path, |
d0c7d7082 ocfs2: btree supp... |
5282 5283 5284 5285 |
subtree_index); } ocfs2_journal_dirty(handle, path_leaf_bh(path)); |
70f18c08b ocfs2: ocfs2_rota... |
5286 |
ret = ocfs2_rotate_tree_left(handle, et, path, dealloc); |
d0c7d7082 ocfs2: btree supp... |
5287 5288 5289 5290 5291 5292 5293 5294 5295 |
if (ret) { mlog_errno(ret); goto out; } out: ocfs2_free_path(left_path); return ret; } |
dbdcf6a48 ocfs2: ocfs2_remo... |
5296 |
int ocfs2_remove_extent(handle_t *handle, |
f99b9b7cc ocfs2: Make ocfs2... |
5297 |
struct ocfs2_extent_tree *et, |
dbdcf6a48 ocfs2: ocfs2_remo... |
5298 |
u32 cpos, u32 len, |
063c4561f ocfs2: support fo... |
5299 |
struct ocfs2_alloc_context *meta_ac, |
f99b9b7cc ocfs2: Make ocfs2... |
5300 |
struct ocfs2_cached_dealloc_ctxt *dealloc) |
d0c7d7082 ocfs2: btree supp... |
5301 5302 5303 5304 5305 |
{ int ret, index; u32 rec_range, trunc_range; struct ocfs2_extent_rec *rec; struct ocfs2_extent_list *el; |
e7d4cb6bc ocfs2: Abstract o... |
5306 |
struct ocfs2_path *path = NULL; |
d0c7d7082 ocfs2: btree supp... |
5307 |
|
4c911eefc ocfs2: Make trunc... |
5308 5309 5310 5311 5312 |
/* * XXX: Why are we truncating to 0 instead of wherever this * affects us? */ ocfs2_et_extent_map_truncate(et, 0); |
d0c7d7082 ocfs2: btree supp... |
5313 |
|
ffdd7a546 ocfs2: Wrap up th... |
5314 |
path = ocfs2_new_path_from_et(et); |
d0c7d7082 ocfs2: btree supp... |
5315 5316 5317 5318 5319 |
if (!path) { ret = -ENOMEM; mlog_errno(ret); goto out; } |
facdb77f5 ocfs2: ocfs2_find... |
5320 |
ret = ocfs2_find_path(et->et_ci, path, cpos); |
d0c7d7082 ocfs2: btree supp... |
5321 5322 5323 5324 5325 5326 5327 |
if (ret) { mlog_errno(ret); goto out; } el = path_leaf_el(path); index = ocfs2_search_extent_list(el, cpos); |
981035b47 ocfs2: correctly ... |
5328 |
if (index == -1) { |
dbdcf6a48 ocfs2: ocfs2_remo... |
5329 |
ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci), |
7ecef14ab ocfs2: neaten do_... |
5330 5331 |
"Owner %llu has an extent at cpos %u which can no longer be found ", |
dbdcf6a48 ocfs2: ocfs2_remo... |
5332 5333 |
(unsigned long long)ocfs2_metadata_cache_owner(et->et_ci), cpos); |
d0c7d7082 ocfs2: btree supp... |
5334 5335 5336 5337 5338 5339 5340 5341 5342 5343 5344 5345 5346 5347 5348 5349 5350 5351 5352 5353 5354 5355 5356 5357 5358 |
ret = -EROFS; goto out; } /* * We have 3 cases of extent removal: * 1) Range covers the entire extent rec * 2) Range begins or ends on one edge of the extent rec * 3) Range is in the middle of the extent rec (no shared edges) * * For case 1 we remove the extent rec and left rotate to * fill the hole. * * For case 2 we just shrink the existing extent rec, with a * tree update if the shrinking edge is also the edge of an * extent block. * * For case 3 we do a right split to turn the extent rec into * something case 2 can handle. */ rec = &el->l_recs[index]; rec_range = le32_to_cpu(rec->e_cpos) + ocfs2_rec_clusters(el, rec); trunc_range = cpos + len; BUG_ON(cpos < le32_to_cpu(rec->e_cpos) || trunc_range > rec_range); |
a09d09b8f ocfs2: Remove mlo... |
5359 5360 5361 5362 |
trace_ocfs2_remove_extent( (unsigned long long)ocfs2_metadata_cache_owner(et->et_ci), cpos, len, index, le32_to_cpu(rec->e_cpos), ocfs2_rec_clusters(el, rec)); |
d0c7d7082 ocfs2: btree supp... |
5363 5364 |
if (le32_to_cpu(rec->e_cpos) == cpos || rec_range == trunc_range) { |
043beebb6 ocfs2: ocfs2_trun... |
5365 5366 |
ret = ocfs2_truncate_rec(handle, et, path, index, dealloc, cpos, len); |
d0c7d7082 ocfs2: btree supp... |
5367 5368 5369 5370 5371 |
if (ret) { mlog_errno(ret); goto out; } } else { |
dbdcf6a48 ocfs2: ocfs2_remo... |
5372 |
ret = ocfs2_split_tree(handle, et, path, index, |
d0c7d7082 ocfs2: btree supp... |
5373 5374 5375 5376 5377 5378 5379 5380 5381 5382 5383 |
trunc_range, meta_ac); if (ret) { mlog_errno(ret); goto out; } /* * The split could have manipulated the tree enough to * move the record location, so we have to look for it again. */ ocfs2_reinit_path(path, 1); |
facdb77f5 ocfs2: ocfs2_find... |
5384 |
ret = ocfs2_find_path(et->et_ci, path, cpos); |
d0c7d7082 ocfs2: btree supp... |
5385 5386 5387 5388 5389 5390 5391 |
if (ret) { mlog_errno(ret); goto out; } el = path_leaf_el(path); index = ocfs2_search_extent_list(el, cpos); |
981035b47 ocfs2: correctly ... |
5392 |
if (index == -1) { |
dbdcf6a48 ocfs2: ocfs2_remo... |
5393 |
ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci), |
7ecef14ab ocfs2: neaten do_... |
5394 5395 |
"Owner %llu: split at cpos %u lost record ", |
dbdcf6a48 ocfs2: ocfs2_remo... |
5396 |
(unsigned long long)ocfs2_metadata_cache_owner(et->et_ci), |
d0c7d7082 ocfs2: btree supp... |
5397 5398 5399 5400 5401 5402 5403 5404 5405 5406 5407 5408 5409 |
cpos); ret = -EROFS; goto out; } /* * Double check our values here. If anything is fishy, * it's easier to catch it at the top level. */ rec = &el->l_recs[index]; rec_range = le32_to_cpu(rec->e_cpos) + ocfs2_rec_clusters(el, rec); if (rec_range != trunc_range) { |
dbdcf6a48 ocfs2: ocfs2_remo... |
5410 |
ocfs2_error(ocfs2_metadata_cache_get_super(et->et_ci), |
7ecef14ab ocfs2: neaten do_... |
5411 5412 |
"Owner %llu: error after split at cpos %u trunc len %u, existing record is (%u,%u) ", |
dbdcf6a48 ocfs2: ocfs2_remo... |
5413 |
(unsigned long long)ocfs2_metadata_cache_owner(et->et_ci), |
d0c7d7082 ocfs2: btree supp... |
5414 5415 5416 5417 5418 |
cpos, len, le32_to_cpu(rec->e_cpos), ocfs2_rec_clusters(el, rec)); ret = -EROFS; goto out; } |
043beebb6 ocfs2: ocfs2_trun... |
5419 5420 |
ret = ocfs2_truncate_rec(handle, et, path, index, dealloc, cpos, len); |
d0c7d7082 ocfs2: btree supp... |
5421 5422 5423 5424 5425 5426 5427 5428 5429 5430 |
if (ret) { mlog_errno(ret); goto out; } } out: ocfs2_free_path(path); return ret; } |
78f94673d Ocfs2: Optimize o... |
5431 5432 5433 5434 5435 5436 5437 5438 5439 5440 5441 5442 5443 5444 5445 5446 5447 5448 5449 5450 |
/* * ocfs2_reserve_blocks_for_rec_trunc() would look basically the * same as ocfs2_lock_alloctors(), except for it accepts a blocks * number to reserve some extra blocks, and it only handles meta * data allocations. * * Currently, only ocfs2_remove_btree_range() uses it for truncating * and punching holes. */ static int ocfs2_reserve_blocks_for_rec_trunc(struct inode *inode, struct ocfs2_extent_tree *et, u32 extents_to_split, struct ocfs2_alloc_context **ac, int extra_blocks) { int ret = 0, num_free_extents; unsigned int max_recs_needed = 2 * extents_to_split; struct ocfs2_super *osb = OCFS2_SB(inode->i_sb); *ac = NULL; |
964f14a0d ocfs2: clean up s... |
5451 |
num_free_extents = ocfs2_num_free_extents(et); |
78f94673d Ocfs2: Optimize o... |
5452 5453 5454 5455 5456 5457 5458 5459 5460 5461 5462 5463 5464 5465 5466 5467 5468 5469 5470 5471 5472 5473 5474 5475 5476 5477 5478 5479 5480 |
if (num_free_extents < 0) { ret = num_free_extents; mlog_errno(ret); goto out; } if (!num_free_extents || (ocfs2_sparse_alloc(osb) && num_free_extents < max_recs_needed)) extra_blocks += ocfs2_extend_meta_needed(et->et_root_el); if (extra_blocks) { ret = ocfs2_reserve_new_metadata_blocks(osb, extra_blocks, ac); if (ret < 0) { if (ret != -ENOSPC) mlog_errno(ret); goto out; } } out: if (ret) { if (*ac) { ocfs2_free_alloc_context(*ac); *ac = NULL; } } return ret; } |
fecc01126 ocfs2: turn __ocf... |
5481 5482 |
int ocfs2_remove_btree_range(struct inode *inode, struct ocfs2_extent_tree *et, |
78f94673d Ocfs2: Optimize o... |
5483 5484 |
u32 cpos, u32 phys_cpos, u32 len, int flags, struct ocfs2_cached_dealloc_ctxt *dealloc, |
f62f12b3a ocfs2: reflink: f... |
5485 |
u64 refcount_loc, bool refcount_tree_locked) |
fecc01126 ocfs2: turn __ocf... |
5486 |
{ |
78f94673d Ocfs2: Optimize o... |
5487 |
int ret, credits = 0, extra_blocks = 0; |
fecc01126 ocfs2: turn __ocf... |
5488 5489 5490 5491 5492 |
u64 phys_blkno = ocfs2_clusters_to_blocks(inode->i_sb, phys_cpos); struct ocfs2_super *osb = OCFS2_SB(inode->i_sb); struct inode *tl_inode = osb->osb_tl_inode; handle_t *handle; struct ocfs2_alloc_context *meta_ac = NULL; |
78f94673d Ocfs2: Optimize o... |
5493 5494 5495 |
struct ocfs2_refcount_tree *ref_tree = NULL; if ((flags & OCFS2_EXT_REFCOUNTED) && len) { |
84e40080b ocfs2: convert in... |
5496 |
BUG_ON(!ocfs2_is_refcount_inode(inode)); |
78f94673d Ocfs2: Optimize o... |
5497 |
|
f62f12b3a ocfs2: reflink: f... |
5498 5499 5500 5501 5502 5503 5504 |
if (!refcount_tree_locked) { ret = ocfs2_lock_refcount_tree(osb, refcount_loc, 1, &ref_tree, NULL); if (ret) { mlog_errno(ret); goto bail; } |
78f94673d Ocfs2: Optimize o... |
5505 5506 5507 5508 5509 5510 5511 5512 5513 5514 |
} ret = ocfs2_prepare_refcount_change_for_del(inode, refcount_loc, phys_blkno, len, &credits, &extra_blocks); if (ret < 0) { mlog_errno(ret); |
33add0e3a ocfs2: fix mutex_... |
5515 |
goto bail; |
78f94673d Ocfs2: Optimize o... |
5516 5517 |
} } |
fecc01126 ocfs2: turn __ocf... |
5518 |
|
78f94673d Ocfs2: Optimize o... |
5519 5520 |
ret = ocfs2_reserve_blocks_for_rec_trunc(inode, et, 1, &meta_ac, extra_blocks); |
fecc01126 ocfs2: turn __ocf... |
5521 5522 |
if (ret) { mlog_errno(ret); |
33add0e3a ocfs2: fix mutex_... |
5523 |
goto bail; |
fecc01126 ocfs2: turn __ocf... |
5524 |
} |
5955102c9 wrappers for ->i_... |
5525 |
inode_lock(tl_inode); |
fecc01126 ocfs2: turn __ocf... |
5526 5527 5528 5529 5530 5531 5532 5533 |
if (ocfs2_truncate_log_needs_flush(osb)) { ret = __ocfs2_flush_truncate_log(osb); if (ret < 0) { mlog_errno(ret); goto out; } } |
78f94673d Ocfs2: Optimize o... |
5534 5535 |
handle = ocfs2_start_trans(osb, ocfs2_remove_extent_credits(osb->sb) + credits); |
fecc01126 ocfs2: turn __ocf... |
5536 5537 5538 5539 5540 |
if (IS_ERR(handle)) { ret = PTR_ERR(handle); mlog_errno(ret); goto out; } |
d9a0a1f83 ocfs2: Store the ... |
5541 |
ret = ocfs2_et_root_journal_access(handle, et, |
13723d00e ocfs2: Use metada... |
5542 |
OCFS2_JOURNAL_ACCESS_WRITE); |
fecc01126 ocfs2: turn __ocf... |
5543 5544 |
if (ret) { mlog_errno(ret); |
b8a0ae579 ocfs2: Commit tra... |
5545 |
goto out_commit; |
fecc01126 ocfs2: turn __ocf... |
5546 |
} |
5dd4056db dquot: cleanup sp... |
5547 |
dquot_free_space_nodirty(inode, |
fd4ef2319 ocfs2: add quota ... |
5548 |
ocfs2_clusters_to_bytes(inode->i_sb, len)); |
dbdcf6a48 ocfs2: ocfs2_remo... |
5549 |
ret = ocfs2_remove_extent(handle, et, cpos, len, meta_ac, dealloc); |
fecc01126 ocfs2: turn __ocf... |
5550 5551 5552 5553 |
if (ret) { mlog_errno(ret); goto out_commit; } |
6136ca5f5 ocfs2: Drop struc... |
5554 |
ocfs2_et_update_clusters(et, -len); |
6fdb702d6 ocfs2: call ocfs2... |
5555 |
ocfs2_update_inode_fsync_trans(handle, inode, 1); |
fecc01126 ocfs2: turn __ocf... |
5556 |
|
ec20cec7a ocfs2: Make ocfs2... |
5557 |
ocfs2_journal_dirty(handle, et->et_root_bh); |
fecc01126 ocfs2: turn __ocf... |
5558 |
|
78f94673d Ocfs2: Optimize o... |
5559 5560 5561 5562 5563 5564 5565 5566 5567 5568 5569 5570 5571 5572 |
if (phys_blkno) { if (flags & OCFS2_EXT_REFCOUNTED) ret = ocfs2_decrease_refcount(inode, handle, ocfs2_blocks_to_clusters(osb->sb, phys_blkno), len, meta_ac, dealloc, 1); else ret = ocfs2_truncate_log_append(osb, handle, phys_blkno, len); if (ret) mlog_errno(ret); } |
fecc01126 ocfs2: turn __ocf... |
5573 5574 5575 5576 |
out_commit: ocfs2_commit_trans(osb, handle); out: |
5955102c9 wrappers for ->i_... |
5577 |
inode_unlock(tl_inode); |
33add0e3a ocfs2: fix mutex_... |
5578 |
bail: |
fecc01126 ocfs2: turn __ocf... |
5579 5580 |
if (meta_ac) ocfs2_free_alloc_context(meta_ac); |
78f94673d Ocfs2: Optimize o... |
5581 5582 |
if (ref_tree) ocfs2_unlock_refcount_tree(osb, ref_tree, 1); |
fecc01126 ocfs2: turn __ocf... |
5583 5584 |
return ret; } |
063c4561f ocfs2: support fo... |
5585 |
int ocfs2_truncate_log_needs_flush(struct ocfs2_super *osb) |
ccd979bdb [PATCH] OCFS2: Th... |
5586 5587 5588 5589 5590 5591 5592 5593 5594 5595 5596 5597 5598 5599 5600 5601 5602 5603 5604 5605 5606 5607 5608 5609 5610 5611 5612 5613 5614 5615 5616 5617 |
{ struct buffer_head *tl_bh = osb->osb_tl_bh; struct ocfs2_dinode *di; struct ocfs2_truncate_log *tl; di = (struct ocfs2_dinode *) tl_bh->b_data; tl = &di->id2.i_dealloc; mlog_bug_on_msg(le16_to_cpu(tl->tl_used) > le16_to_cpu(tl->tl_count), "slot %d, invalid truncate log parameters: used = " "%u, count = %u ", osb->slot_num, le16_to_cpu(tl->tl_used), le16_to_cpu(tl->tl_count)); return le16_to_cpu(tl->tl_used) == le16_to_cpu(tl->tl_count); } static int ocfs2_truncate_log_can_coalesce(struct ocfs2_truncate_log *tl, unsigned int new_start) { unsigned int tail_index; unsigned int current_tail; /* No records, nothing to coalesce */ if (!le16_to_cpu(tl->tl_used)) return 0; tail_index = le16_to_cpu(tl->tl_used) - 1; current_tail = le32_to_cpu(tl->tl_recs[tail_index].t_start); current_tail += le32_to_cpu(tl->tl_recs[tail_index].t_clusters); return current_tail == new_start; } |
063c4561f ocfs2: support fo... |
5618 5619 5620 5621 |
int ocfs2_truncate_log_append(struct ocfs2_super *osb, handle_t *handle, u64 start_blk, unsigned int num_clusters) |
ccd979bdb [PATCH] OCFS2: Th... |
5622 5623 5624 5625 5626 5627 5628 |
{ int status, index; unsigned int start_cluster, tl_count; struct inode *tl_inode = osb->osb_tl_inode; struct buffer_head *tl_bh = osb->osb_tl_bh; struct ocfs2_dinode *di; struct ocfs2_truncate_log *tl; |
5955102c9 wrappers for ->i_... |
5629 |
BUG_ON(inode_trylock(tl_inode)); |
ccd979bdb [PATCH] OCFS2: Th... |
5630 5631 5632 5633 |
start_cluster = ocfs2_blocks_to_clusters(osb->sb, start_blk); di = (struct ocfs2_dinode *) tl_bh->b_data; |
ccd979bdb [PATCH] OCFS2: Th... |
5634 |
|
10995aa24 ocfs2: Morph the ... |
5635 5636 5637 5638 5639 5640 |
/* tl_bh is loaded from ocfs2_truncate_log_init(). It's validated * by the underlying call to ocfs2_read_inode_block(), so any * corruption is a code bug */ BUG_ON(!OCFS2_IS_VALID_DINODE(di)); tl = &di->id2.i_dealloc; |
ccd979bdb [PATCH] OCFS2: Th... |
5641 5642 5643 |
tl_count = le16_to_cpu(tl->tl_count); mlog_bug_on_msg(tl_count > ocfs2_truncate_recs_per_inode(osb->sb) || tl_count == 0, |
b0697053f ocfs2: don't use ... |
5644 5645 5646 5647 |
"Truncate record count on #%llu invalid " "wanted %u, actual %u ", (unsigned long long)OCFS2_I(tl_inode)->ip_blkno, |
ccd979bdb [PATCH] OCFS2: Th... |
5648 5649 5650 5651 5652 5653 5654 5655 5656 5657 |
ocfs2_truncate_recs_per_inode(osb->sb), le16_to_cpu(tl->tl_count)); /* Caller should have known to flush before calling us. */ index = le16_to_cpu(tl->tl_used); if (index >= tl_count) { status = -ENOSPC; mlog_errno(status); goto bail; } |
0cf2f7632 ocfs2: Pass struc... |
5658 |
status = ocfs2_journal_access_di(handle, INODE_CACHE(tl_inode), tl_bh, |
13723d00e ocfs2: Use metada... |
5659 |
OCFS2_JOURNAL_ACCESS_WRITE); |
ccd979bdb [PATCH] OCFS2: Th... |
5660 5661 5662 5663 |
if (status < 0) { mlog_errno(status); goto bail; } |
a09d09b8f ocfs2: Remove mlo... |
5664 5665 5666 |
trace_ocfs2_truncate_log_append( (unsigned long long)OCFS2_I(tl_inode)->ip_blkno, index, start_cluster, num_clusters); |
ccd979bdb [PATCH] OCFS2: Th... |
5667 5668 5669 5670 5671 5672 5673 5674 |
if (ocfs2_truncate_log_can_coalesce(tl, start_cluster)) { /* * Move index back to the record we are coalescing with. * ocfs2_truncate_log_can_coalesce() guarantees nonzero */ index--; num_clusters += le32_to_cpu(tl->tl_recs[index].t_clusters); |
a09d09b8f ocfs2: Remove mlo... |
5675 5676 5677 5678 |
trace_ocfs2_truncate_log_append( (unsigned long long)OCFS2_I(tl_inode)->ip_blkno, index, le32_to_cpu(tl->tl_recs[index].t_start), num_clusters); |
ccd979bdb [PATCH] OCFS2: Th... |
5679 5680 5681 5682 5683 |
} else { tl->tl_recs[index].t_start = cpu_to_le32(start_cluster); tl->tl_used = cpu_to_le16(index + 1); } tl->tl_recs[index].t_clusters = cpu_to_le32(num_clusters); |
ec20cec7a ocfs2: Make ocfs2... |
5684 |
ocfs2_journal_dirty(handle, tl_bh); |
ccd979bdb [PATCH] OCFS2: Th... |
5685 |
|
50308d813 ocfs2: Try to fre... |
5686 |
osb->truncated_clusters += num_clusters; |
ccd979bdb [PATCH] OCFS2: Th... |
5687 |
bail: |
ccd979bdb [PATCH] OCFS2: Th... |
5688 5689 5690 5691 |
return status; } static int ocfs2_replay_truncate_records(struct ocfs2_super *osb, |
ccd979bdb [PATCH] OCFS2: Th... |
5692 5693 5694 5695 5696 5697 5698 5699 5700 5701 5702 5703 |
struct inode *data_alloc_inode, struct buffer_head *data_alloc_bh) { int status = 0; int i; unsigned int num_clusters; u64 start_blk; struct ocfs2_truncate_rec rec; struct ocfs2_dinode *di; struct ocfs2_truncate_log *tl; struct inode *tl_inode = osb->osb_tl_inode; struct buffer_head *tl_bh = osb->osb_tl_bh; |
2b0ad0085 ocfs2: fix trans ... |
5704 |
handle_t *handle; |
ccd979bdb [PATCH] OCFS2: Th... |
5705 |
|
ccd979bdb [PATCH] OCFS2: Th... |
5706 5707 5708 5709 |
di = (struct ocfs2_dinode *) tl_bh->b_data; tl = &di->id2.i_dealloc; i = le16_to_cpu(tl->tl_used) - 1; while (i >= 0) { |
2b0ad0085 ocfs2: fix trans ... |
5710 5711 5712 5713 5714 5715 |
handle = ocfs2_start_trans(osb, OCFS2_TRUNCATE_LOG_FLUSH_ONE_REC); if (IS_ERR(handle)) { status = PTR_ERR(handle); mlog_errno(status); goto bail; } |
ccd979bdb [PATCH] OCFS2: Th... |
5716 5717 |
/* Caller has given us at least enough credits to * update the truncate log dinode */ |
0cf2f7632 ocfs2: Pass struc... |
5718 |
status = ocfs2_journal_access_di(handle, INODE_CACHE(tl_inode), tl_bh, |
13723d00e ocfs2: Use metada... |
5719 |
OCFS2_JOURNAL_ACCESS_WRITE); |
ccd979bdb [PATCH] OCFS2: Th... |
5720 5721 5722 5723 5724 5725 |
if (status < 0) { mlog_errno(status); goto bail; } tl->tl_used = cpu_to_le16(i); |
ec20cec7a ocfs2: Make ocfs2... |
5726 |
ocfs2_journal_dirty(handle, tl_bh); |
ccd979bdb [PATCH] OCFS2: Th... |
5727 |
|
ccd979bdb [PATCH] OCFS2: Th... |
5728 5729 5730 5731 5732 5733 5734 5735 |
rec = tl->tl_recs[i]; start_blk = ocfs2_clusters_to_blocks(data_alloc_inode->i_sb, le32_to_cpu(rec.t_start)); num_clusters = le32_to_cpu(rec.t_clusters); /* if start_blk is not set, we ignore the record as * invalid. */ if (start_blk) { |
a09d09b8f ocfs2: Remove mlo... |
5736 5737 5738 |
trace_ocfs2_replay_truncate_records( (unsigned long long)OCFS2_I(tl_inode)->ip_blkno, i, le32_to_cpu(rec.t_start), num_clusters); |
ccd979bdb [PATCH] OCFS2: Th... |
5739 5740 5741 5742 5743 5744 5745 5746 5747 |
status = ocfs2_free_clusters(handle, data_alloc_inode, data_alloc_bh, start_blk, num_clusters); if (status < 0) { mlog_errno(status); goto bail; } } |
102c2595a ocfs2: extend eno... |
5748 |
|
2b0ad0085 ocfs2: fix trans ... |
5749 |
ocfs2_commit_trans(osb, handle); |
ccd979bdb [PATCH] OCFS2: Th... |
5750 5751 |
i--; } |
50308d813 ocfs2: Try to fre... |
5752 |
osb->truncated_clusters = 0; |
ccd979bdb [PATCH] OCFS2: Th... |
5753 |
bail: |
ccd979bdb [PATCH] OCFS2: Th... |
5754 5755 |
return status; } |
1b1dcc1b5 [PATCH] mutex sub... |
5756 |
/* Expects you to already be holding tl_inode->i_mutex */ |
063c4561f ocfs2: support fo... |
5757 |
int __ocfs2_flush_truncate_log(struct ocfs2_super *osb) |
ccd979bdb [PATCH] OCFS2: Th... |
5758 5759 5760 |
{ int status; unsigned int num_to_flush; |
ccd979bdb [PATCH] OCFS2: Th... |
5761 5762 5763 5764 5765 5766 |
struct inode *tl_inode = osb->osb_tl_inode; struct inode *data_alloc_inode = NULL; struct buffer_head *tl_bh = osb->osb_tl_bh; struct buffer_head *data_alloc_bh = NULL; struct ocfs2_dinode *di; struct ocfs2_truncate_log *tl; |
5955102c9 wrappers for ->i_... |
5767 |
BUG_ON(inode_trylock(tl_inode)); |
ccd979bdb [PATCH] OCFS2: Th... |
5768 5769 |
di = (struct ocfs2_dinode *) tl_bh->b_data; |
ccd979bdb [PATCH] OCFS2: Th... |
5770 |
|
10995aa24 ocfs2: Morph the ... |
5771 5772 5773 5774 5775 5776 |
/* tl_bh is loaded from ocfs2_truncate_log_init(). It's validated * by the underlying call to ocfs2_read_inode_block(), so any * corruption is a code bug */ BUG_ON(!OCFS2_IS_VALID_DINODE(di)); tl = &di->id2.i_dealloc; |
ccd979bdb [PATCH] OCFS2: Th... |
5777 |
num_to_flush = le16_to_cpu(tl->tl_used); |
a09d09b8f ocfs2: Remove mlo... |
5778 5779 5780 |
trace_ocfs2_flush_truncate_log( (unsigned long long)OCFS2_I(tl_inode)->ip_blkno, num_to_flush); |
ccd979bdb [PATCH] OCFS2: Th... |
5781 5782 |
if (!num_to_flush) { status = 0; |
e08dc8b98 ocfs2: don't pass... |
5783 |
goto out; |
ccd979bdb [PATCH] OCFS2: Th... |
5784 5785 5786 5787 5788 5789 5790 5791 5792 |
} data_alloc_inode = ocfs2_get_system_file_inode(osb, GLOBAL_BITMAP_SYSTEM_INODE, OCFS2_INVALID_SLOT); if (!data_alloc_inode) { status = -EINVAL; mlog(ML_ERROR, "Could not get bitmap inode! "); |
e08dc8b98 ocfs2: don't pass... |
5793 |
goto out; |
ccd979bdb [PATCH] OCFS2: Th... |
5794 |
} |
5955102c9 wrappers for ->i_... |
5795 |
inode_lock(data_alloc_inode); |
e08dc8b98 ocfs2: don't pass... |
5796 |
|
e63aecb65 ocfs2: Rename ocf... |
5797 |
status = ocfs2_inode_lock(data_alloc_inode, &data_alloc_bh, 1); |
ccd979bdb [PATCH] OCFS2: Th... |
5798 5799 |
if (status < 0) { mlog_errno(status); |
e08dc8b98 ocfs2: don't pass... |
5800 |
goto out_mutex; |
ccd979bdb [PATCH] OCFS2: Th... |
5801 |
} |
2b0ad0085 ocfs2: fix trans ... |
5802 |
status = ocfs2_replay_truncate_records(osb, data_alloc_inode, |
ccd979bdb [PATCH] OCFS2: Th... |
5803 |
data_alloc_bh); |
e08dc8b98 ocfs2: don't pass... |
5804 |
if (status < 0) |
ccd979bdb [PATCH] OCFS2: Th... |
5805 |
mlog_errno(status); |
ccd979bdb [PATCH] OCFS2: Th... |
5806 |
|
e08dc8b98 ocfs2: don't pass... |
5807 |
brelse(data_alloc_bh); |
e63aecb65 ocfs2: Rename ocf... |
5808 |
ocfs2_inode_unlock(data_alloc_inode, 1); |
ccd979bdb [PATCH] OCFS2: Th... |
5809 |
|
e08dc8b98 ocfs2: don't pass... |
5810 |
out_mutex: |
5955102c9 wrappers for ->i_... |
5811 |
inode_unlock(data_alloc_inode); |
e08dc8b98 ocfs2: don't pass... |
5812 |
iput(data_alloc_inode); |
ccd979bdb [PATCH] OCFS2: Th... |
5813 |
|
e08dc8b98 ocfs2: don't pass... |
5814 |
out: |
ccd979bdb [PATCH] OCFS2: Th... |
5815 5816 5817 5818 5819 5820 5821 |
return status; } int ocfs2_flush_truncate_log(struct ocfs2_super *osb) { int status; struct inode *tl_inode = osb->osb_tl_inode; |
5955102c9 wrappers for ->i_... |
5822 |
inode_lock(tl_inode); |
ccd979bdb [PATCH] OCFS2: Th... |
5823 |
status = __ocfs2_flush_truncate_log(osb); |
5955102c9 wrappers for ->i_... |
5824 |
inode_unlock(tl_inode); |
ccd979bdb [PATCH] OCFS2: Th... |
5825 5826 5827 |
return status; } |
c4028958b WorkStruct: make ... |
5828 |
static void ocfs2_truncate_log_worker(struct work_struct *work) |
ccd979bdb [PATCH] OCFS2: Th... |
5829 5830 |
{ int status; |
c4028958b WorkStruct: make ... |
5831 5832 5833 |
struct ocfs2_super *osb = container_of(work, struct ocfs2_super, osb_truncate_log_wq.work); |
ccd979bdb [PATCH] OCFS2: Th... |
5834 |
|
ccd979bdb [PATCH] OCFS2: Th... |
5835 5836 5837 |
status = ocfs2_flush_truncate_log(osb); if (status < 0) mlog_errno(status); |
4d0ddb2ce ocfs2: Add inode ... |
5838 |
else |
b89c54282 ocfs2: add extent... |
5839 |
ocfs2_init_steal_slots(osb); |
ccd979bdb [PATCH] OCFS2: Th... |
5840 5841 5842 5843 5844 5845 |
} #define OCFS2_TRUNCATE_LOG_FLUSH_INTERVAL (2 * HZ) void ocfs2_schedule_truncate_log_flush(struct ocfs2_super *osb, int cancel) { |
a9e9acaeb ocfs2: fix umount... |
5846 5847 |
if (osb->osb_tl_inode && atomic_read(&osb->osb_tl_disable) == 0) { |
ccd979bdb [PATCH] OCFS2: Th... |
5848 5849 5850 5851 |
/* We want to push off log flushes while truncates are * still running. */ if (cancel) cancel_delayed_work(&osb->osb_truncate_log_wq); |
35ddf78e4 ocfs2: fix occurr... |
5852 |
queue_delayed_work(osb->ocfs2_wq, &osb->osb_truncate_log_wq, |
ccd979bdb [PATCH] OCFS2: Th... |
5853 5854 5855 |
OCFS2_TRUNCATE_LOG_FLUSH_INTERVAL); } } |
2070ad1ae ocfs2: retry on E... |
5856 5857 5858 5859 5860 5861 5862 5863 5864 5865 5866 5867 5868 5869 5870 5871 5872 5873 5874 5875 5876 5877 5878 5879 5880 5881 5882 5883 5884 5885 5886 5887 5888 5889 5890 5891 |
/* * Try to flush truncate logs if we can free enough clusters from it. * As for return value, "< 0" means error, "0" no space and "1" means * we have freed enough spaces and let the caller try to allocate again. */ int ocfs2_try_to_free_truncate_log(struct ocfs2_super *osb, unsigned int needed) { tid_t target; int ret = 0; unsigned int truncated_clusters; inode_lock(osb->osb_tl_inode); truncated_clusters = osb->truncated_clusters; inode_unlock(osb->osb_tl_inode); /* * Check whether we can succeed in allocating if we free * the truncate log. */ if (truncated_clusters < needed) goto out; ret = ocfs2_flush_truncate_log(osb); if (ret) { mlog_errno(ret); goto out; } if (jbd2_journal_start_commit(osb->journal->j_journal, &target)) { jbd2_log_wait_commit(osb->journal->j_journal, target); ret = 1; } out: return ret; } |
ccd979bdb [PATCH] OCFS2: Th... |
5892 5893 5894 5895 5896 5897 5898 5899 5900 5901 5902 5903 5904 5905 5906 5907 5908 5909 |
static int ocfs2_get_truncate_log_info(struct ocfs2_super *osb, int slot_num, struct inode **tl_inode, struct buffer_head **tl_bh) { int status; struct inode *inode = NULL; struct buffer_head *bh = NULL; inode = ocfs2_get_system_file_inode(osb, TRUNCATE_LOG_SYSTEM_INODE, slot_num); if (!inode) { status = -EINVAL; mlog(ML_ERROR, "Could not get load truncate log inode! "); goto bail; } |
b657c95c1 ocfs2: Wrap inode... |
5910 |
status = ocfs2_read_inode_block(inode, &bh); |
ccd979bdb [PATCH] OCFS2: Th... |
5911 5912 5913 5914 5915 5916 5917 5918 5919 |
if (status < 0) { iput(inode); mlog_errno(status); goto bail; } *tl_inode = inode; *tl_bh = bh; bail: |
ccd979bdb [PATCH] OCFS2: Th... |
5920 5921 5922 5923 5924 5925 5926 5927 5928 5929 5930 5931 5932 5933 5934 5935 5936 5937 |
return status; } /* called during the 1st stage of node recovery. we stamp a clean * truncate log and pass back a copy for processing later. if the * truncate log does not require processing, a *tl_copy is set to * NULL. */ int ocfs2_begin_truncate_log_recovery(struct ocfs2_super *osb, int slot_num, struct ocfs2_dinode **tl_copy) { int status; struct inode *tl_inode = NULL; struct buffer_head *tl_bh = NULL; struct ocfs2_dinode *di; struct ocfs2_truncate_log *tl; *tl_copy = NULL; |
a09d09b8f ocfs2: Remove mlo... |
5938 |
trace_ocfs2_begin_truncate_log_recovery(slot_num); |
ccd979bdb [PATCH] OCFS2: Th... |
5939 5940 5941 5942 5943 5944 5945 5946 |
status = ocfs2_get_truncate_log_info(osb, slot_num, &tl_inode, &tl_bh); if (status < 0) { mlog_errno(status); goto bail; } di = (struct ocfs2_dinode *) tl_bh->b_data; |
ccd979bdb [PATCH] OCFS2: Th... |
5947 |
|
10995aa24 ocfs2: Morph the ... |
5948 5949 5950 5951 5952 5953 |
/* tl_bh is loaded from ocfs2_get_truncate_log_info(). It's * validated by the underlying call to ocfs2_read_inode_block(), * so any corruption is a code bug */ BUG_ON(!OCFS2_IS_VALID_DINODE(di)); tl = &di->id2.i_dealloc; |
ccd979bdb [PATCH] OCFS2: Th... |
5954 |
if (le16_to_cpu(tl->tl_used)) { |
a09d09b8f ocfs2: Remove mlo... |
5955 |
trace_ocfs2_truncate_log_recovery_num(le16_to_cpu(tl->tl_used)); |
ccd979bdb [PATCH] OCFS2: Th... |
5956 5957 5958 5959 5960 5961 5962 5963 5964 5965 5966 5967 5968 5969 5970 |
*tl_copy = kmalloc(tl_bh->b_size, GFP_KERNEL); if (!(*tl_copy)) { status = -ENOMEM; mlog_errno(status); goto bail; } /* Assuming the write-out below goes well, this copy * will be passed back to recovery for processing. */ memcpy(*tl_copy, tl_bh->b_data, tl_bh->b_size); /* All we need to do to clear the truncate log is set * tl_used. */ tl->tl_used = 0; |
13723d00e ocfs2: Use metada... |
5971 |
ocfs2_compute_meta_ecc(osb->sb, tl_bh->b_data, &di->i_check); |
8cb471e8f ocfs2: Take the i... |
5972 |
status = ocfs2_write_block(osb, tl_bh, INODE_CACHE(tl_inode)); |
ccd979bdb [PATCH] OCFS2: Th... |
5973 5974 5975 5976 5977 5978 5979 |
if (status < 0) { mlog_errno(status); goto bail; } } bail: |
72865d923 ocfs2: clean up r... |
5980 |
iput(tl_inode); |
a81cb88b6 ocfs2: Don't chec... |
5981 |
brelse(tl_bh); |
ccd979bdb [PATCH] OCFS2: Th... |
5982 |
|
46359295a ocfs2: clean up r... |
5983 |
if (status < 0) { |
ccd979bdb [PATCH] OCFS2: Th... |
5984 5985 |
kfree(*tl_copy); *tl_copy = NULL; |
c1e8d35ef ocfs2: Remove EXI... |
5986 |
mlog_errno(status); |
ccd979bdb [PATCH] OCFS2: Th... |
5987 |
} |
ccd979bdb [PATCH] OCFS2: Th... |
5988 5989 5990 5991 5992 5993 5994 5995 5996 5997 |
return status; } int ocfs2_complete_truncate_log_recovery(struct ocfs2_super *osb, struct ocfs2_dinode *tl_copy) { int status = 0; int i; unsigned int clusters, num_recs, start_cluster; u64 start_blk; |
1fabe1481 ocfs2: Remove str... |
5998 |
handle_t *handle; |
ccd979bdb [PATCH] OCFS2: Th... |
5999 6000 |
struct inode *tl_inode = osb->osb_tl_inode; struct ocfs2_truncate_log *tl; |
ccd979bdb [PATCH] OCFS2: Th... |
6001 6002 6003 6004 6005 6006 6007 6008 |
if (OCFS2_I(tl_inode)->ip_blkno == le64_to_cpu(tl_copy->i_blkno)) { mlog(ML_ERROR, "Asked to recover my own truncate log! "); return -EINVAL; } tl = &tl_copy->id2.i_dealloc; num_recs = le16_to_cpu(tl->tl_used); |
a09d09b8f ocfs2: Remove mlo... |
6009 6010 6011 |
trace_ocfs2_complete_truncate_log_recovery( (unsigned long long)le64_to_cpu(tl_copy->i_blkno), num_recs); |
ccd979bdb [PATCH] OCFS2: Th... |
6012 |
|
5955102c9 wrappers for ->i_... |
6013 |
inode_lock(tl_inode); |
ccd979bdb [PATCH] OCFS2: Th... |
6014 6015 6016 6017 6018 6019 6020 6021 |
for(i = 0; i < num_recs; i++) { if (ocfs2_truncate_log_needs_flush(osb)) { status = __ocfs2_flush_truncate_log(osb); if (status < 0) { mlog_errno(status); goto bail_up; } } |
65eff9ccf ocfs2: remove han... |
6022 |
handle = ocfs2_start_trans(osb, OCFS2_TRUNCATE_LOG_UPDATE); |
ccd979bdb [PATCH] OCFS2: Th... |
6023 6024 6025 6026 6027 6028 6029 6030 6031 6032 6033 6034 |
if (IS_ERR(handle)) { status = PTR_ERR(handle); mlog_errno(status); goto bail_up; } clusters = le32_to_cpu(tl->tl_recs[i].t_clusters); start_cluster = le32_to_cpu(tl->tl_recs[i].t_start); start_blk = ocfs2_clusters_to_blocks(osb->sb, start_cluster); status = ocfs2_truncate_log_append(osb, handle, start_blk, clusters); |
02dc1af44 ocfs2: pass ocfs2... |
6035 |
ocfs2_commit_trans(osb, handle); |
ccd979bdb [PATCH] OCFS2: Th... |
6036 6037 6038 6039 6040 6041 6042 |
if (status < 0) { mlog_errno(status); goto bail_up; } } bail_up: |
5955102c9 wrappers for ->i_... |
6043 |
inode_unlock(tl_inode); |
ccd979bdb [PATCH] OCFS2: Th... |
6044 |
|
ccd979bdb [PATCH] OCFS2: Th... |
6045 6046 6047 6048 6049 6050 6051 |
return status; } void ocfs2_truncate_log_shutdown(struct ocfs2_super *osb) { int status; struct inode *tl_inode = osb->osb_tl_inode; |
a9e9acaeb ocfs2: fix umount... |
6052 |
atomic_set(&osb->osb_tl_disable, 1); |
ccd979bdb [PATCH] OCFS2: Th... |
6053 6054 |
if (tl_inode) { cancel_delayed_work(&osb->osb_truncate_log_wq); |
35ddf78e4 ocfs2: fix occurr... |
6055 |
flush_workqueue(osb->ocfs2_wq); |
ccd979bdb [PATCH] OCFS2: Th... |
6056 6057 6058 6059 6060 6061 6062 6063 |
status = ocfs2_flush_truncate_log(osb); if (status < 0) mlog_errno(status); brelse(osb->osb_tl_bh); iput(osb->osb_tl_inode); } |
ccd979bdb [PATCH] OCFS2: Th... |
6064 6065 6066 6067 6068 6069 6070 |
} int ocfs2_truncate_log_init(struct ocfs2_super *osb) { int status; struct inode *tl_inode = NULL; struct buffer_head *tl_bh = NULL; |
ccd979bdb [PATCH] OCFS2: Th... |
6071 6072 6073 6074 6075 6076 6077 6078 6079 6080 |
status = ocfs2_get_truncate_log_info(osb, osb->slot_num, &tl_inode, &tl_bh); if (status < 0) mlog_errno(status); /* ocfs2_truncate_log_shutdown keys on the existence of * osb->osb_tl_inode so we don't set any of the osb variables * until we're sure all is well. */ |
c4028958b WorkStruct: make ... |
6081 6082 |
INIT_DELAYED_WORK(&osb->osb_truncate_log_wq, ocfs2_truncate_log_worker); |
a9e9acaeb ocfs2: fix umount... |
6083 |
atomic_set(&osb->osb_tl_disable, 0); |
ccd979bdb [PATCH] OCFS2: Th... |
6084 6085 |
osb->osb_tl_bh = tl_bh; osb->osb_tl_inode = tl_inode; |
ccd979bdb [PATCH] OCFS2: Th... |
6086 6087 |
return status; } |
2b604351b ocfs2: simplify d... |
6088 6089 6090 6091 6092 6093 6094 6095 6096 6097 6098 6099 6100 6101 6102 6103 6104 6105 6106 |
/* * Delayed de-allocation of suballocator blocks. * * Some sets of block de-allocations might involve multiple suballocator inodes. * * The locking for this can get extremely complicated, especially when * the suballocator inodes to delete from aren't known until deep * within an unrelated codepath. * * ocfs2_extent_block structures are a good example of this - an inode * btree could have been grown by any number of nodes each allocating * out of their own suballoc inode. * * These structures allow the delay of block de-allocation until a * later time, when locking of multiple cluster inodes won't cause * deadlock. */ /* |
2891d290a ocfs2: Add cluste... |
6107 6108 6109 6110 |
* Describe a single bit freed from a suballocator. For the block * suballocators, it represents one block. For the global cluster * allocator, it represents some clusters and free_bit indicates * clusters number. |
2b604351b ocfs2: simplify d... |
6111 6112 6113 |
*/ struct ocfs2_cached_block_free { struct ocfs2_cached_block_free *free_next; |
74380c479 ocfs2: Free block... |
6114 |
u64 free_bg; |
2b604351b ocfs2: simplify d... |
6115 6116 6117 6118 6119 6120 6121 6122 6123 6124 |
u64 free_blk; unsigned int free_bit; }; struct ocfs2_per_slot_free_list { struct ocfs2_per_slot_free_list *f_next_suballocator; int f_inode_type; int f_slot; struct ocfs2_cached_block_free *f_first; }; |
2891d290a ocfs2: Add cluste... |
6125 6126 6127 6128 |
static int ocfs2_free_cached_blocks(struct ocfs2_super *osb, int sysfile_type, int slot, struct ocfs2_cached_block_free *head) |
2b604351b ocfs2: simplify d... |
6129 6130 6131 6132 6133 6134 6135 6136 6137 6138 6139 6140 6141 6142 |
{ int ret; u64 bg_blkno; handle_t *handle; struct inode *inode; struct buffer_head *di_bh = NULL; struct ocfs2_cached_block_free *tmp; inode = ocfs2_get_system_file_inode(osb, sysfile_type, slot); if (!inode) { ret = -EINVAL; mlog_errno(ret); goto out; } |
5955102c9 wrappers for ->i_... |
6143 |
inode_lock(inode); |
2b604351b ocfs2: simplify d... |
6144 |
|
e63aecb65 ocfs2: Rename ocf... |
6145 |
ret = ocfs2_inode_lock(inode, &di_bh, 1); |
2b604351b ocfs2: simplify d... |
6146 6147 6148 6149 |
if (ret) { mlog_errno(ret); goto out_mutex; } |
2b604351b ocfs2: simplify d... |
6150 |
while (head) { |
74380c479 ocfs2: Free block... |
6151 6152 6153 6154 6155 |
if (head->free_bg) bg_blkno = head->free_bg; else bg_blkno = ocfs2_which_suballoc_group(head->free_blk, head->free_bit); |
d5bf14189 ocfs2: fix trans ... |
6156 6157 6158 6159 6160 6161 |
handle = ocfs2_start_trans(osb, OCFS2_SUBALLOC_FREE); if (IS_ERR(handle)) { ret = PTR_ERR(handle); mlog_errno(ret); goto out_unlock; } |
a09d09b8f ocfs2: Remove mlo... |
6162 6163 |
trace_ocfs2_free_cached_blocks( (unsigned long long)head->free_blk, head->free_bit); |
2b604351b ocfs2: simplify d... |
6164 6165 6166 |
ret = ocfs2_free_suballoc_bits(handle, inode, di_bh, head->free_bit, bg_blkno, 1); |
d5bf14189 ocfs2: fix trans ... |
6167 |
if (ret) |
2b604351b ocfs2: simplify d... |
6168 |
mlog_errno(ret); |
2b604351b ocfs2: simplify d... |
6169 |
|
d5bf14189 ocfs2: fix trans ... |
6170 |
ocfs2_commit_trans(osb, handle); |
2b604351b ocfs2: simplify d... |
6171 6172 6173 6174 6175 |
tmp = head; head = head->free_next; kfree(tmp); } |
2b604351b ocfs2: simplify d... |
6176 |
out_unlock: |
e63aecb65 ocfs2: Rename ocf... |
6177 |
ocfs2_inode_unlock(inode, 1); |
2b604351b ocfs2: simplify d... |
6178 6179 |
brelse(di_bh); out_mutex: |
5955102c9 wrappers for ->i_... |
6180 |
inode_unlock(inode); |
2b604351b ocfs2: simplify d... |
6181 6182 6183 6184 6185 6186 6187 6188 6189 6190 6191 |
iput(inode); out: while(head) { /* Premature exit may have left some dangling items. */ tmp = head; head = head->free_next; kfree(tmp); } return ret; } |
2891d290a ocfs2: Add cluste... |
6192 6193 6194 6195 6196 |
int ocfs2_cache_cluster_dealloc(struct ocfs2_cached_dealloc_ctxt *ctxt, u64 blkno, unsigned int bit) { int ret = 0; struct ocfs2_cached_block_free *item; |
74380c479 ocfs2: Free block... |
6197 |
item = kzalloc(sizeof(*item), GFP_NOFS); |
2891d290a ocfs2: Add cluste... |
6198 6199 6200 6201 6202 |
if (item == NULL) { ret = -ENOMEM; mlog_errno(ret); return ret; } |
a09d09b8f ocfs2: Remove mlo... |
6203 |
trace_ocfs2_cache_cluster_dealloc((unsigned long long)blkno, bit); |
2891d290a ocfs2: Add cluste... |
6204 6205 6206 6207 6208 6209 6210 6211 6212 6213 6214 6215 6216 6217 6218 6219 |
item->free_blk = blkno; item->free_bit = bit; item->free_next = ctxt->c_global_allocator; ctxt->c_global_allocator = item; return ret; } static int ocfs2_free_cached_clusters(struct ocfs2_super *osb, struct ocfs2_cached_block_free *head) { struct ocfs2_cached_block_free *tmp; struct inode *tl_inode = osb->osb_tl_inode; handle_t *handle; int ret = 0; |
5955102c9 wrappers for ->i_... |
6220 |
inode_lock(tl_inode); |
2891d290a ocfs2: Add cluste... |
6221 6222 6223 6224 6225 6226 6227 6228 6229 6230 6231 6232 6233 6234 6235 6236 6237 6238 6239 6240 6241 6242 6243 6244 6245 6246 6247 6248 6249 6250 |
while (head) { if (ocfs2_truncate_log_needs_flush(osb)) { ret = __ocfs2_flush_truncate_log(osb); if (ret < 0) { mlog_errno(ret); break; } } handle = ocfs2_start_trans(osb, OCFS2_TRUNCATE_LOG_UPDATE); if (IS_ERR(handle)) { ret = PTR_ERR(handle); mlog_errno(ret); break; } ret = ocfs2_truncate_log_append(osb, handle, head->free_blk, head->free_bit); ocfs2_commit_trans(osb, handle); tmp = head; head = head->free_next; kfree(tmp); if (ret < 0) { mlog_errno(ret); break; } } |
5955102c9 wrappers for ->i_... |
6251 |
inode_unlock(tl_inode); |
2891d290a ocfs2: Add cluste... |
6252 6253 6254 6255 6256 6257 6258 6259 6260 6261 |
while (head) { /* Premature exit may have left some dangling items. */ tmp = head; head = head->free_next; kfree(tmp); } return ret; } |
2b604351b ocfs2: simplify d... |
6262 6263 6264 6265 6266 6267 6268 6269 6270 6271 6272 6273 6274 |
int ocfs2_run_deallocs(struct ocfs2_super *osb, struct ocfs2_cached_dealloc_ctxt *ctxt) { int ret = 0, ret2; struct ocfs2_per_slot_free_list *fl; if (!ctxt) return 0; while (ctxt->c_first_suballocator) { fl = ctxt->c_first_suballocator; if (fl->f_first) { |
a09d09b8f ocfs2: Remove mlo... |
6275 6276 |
trace_ocfs2_run_deallocs(fl->f_inode_type, fl->f_slot); |
2891d290a ocfs2: Add cluste... |
6277 6278 6279 6280 |
ret2 = ocfs2_free_cached_blocks(osb, fl->f_inode_type, fl->f_slot, fl->f_first); |
2b604351b ocfs2: simplify d... |
6281 6282 6283 6284 6285 6286 6287 6288 6289 |
if (ret2) mlog_errno(ret2); if (!ret) ret = ret2; } ctxt->c_first_suballocator = fl->f_next_suballocator; kfree(fl); } |
2891d290a ocfs2: Add cluste... |
6290 6291 6292 6293 6294 6295 6296 6297 6298 6299 |
if (ctxt->c_global_allocator) { ret2 = ocfs2_free_cached_clusters(osb, ctxt->c_global_allocator); if (ret2) mlog_errno(ret2); if (!ret) ret = ret2; ctxt->c_global_allocator = NULL; } |
2b604351b ocfs2: simplify d... |
6300 6301 6302 6303 6304 6305 6306 6307 6308 6309 6310 6311 6312 6313 6314 6315 6316 6317 6318 6319 6320 6321 6322 6323 6324 6325 6326 6327 |
return ret; } static struct ocfs2_per_slot_free_list * ocfs2_find_per_slot_free_list(int type, int slot, struct ocfs2_cached_dealloc_ctxt *ctxt) { struct ocfs2_per_slot_free_list *fl = ctxt->c_first_suballocator; while (fl) { if (fl->f_inode_type == type && fl->f_slot == slot) return fl; fl = fl->f_next_suballocator; } fl = kmalloc(sizeof(*fl), GFP_NOFS); if (fl) { fl->f_inode_type = type; fl->f_slot = slot; fl->f_first = NULL; fl->f_next_suballocator = ctxt->c_first_suballocator; ctxt->c_first_suballocator = fl; } return fl; } |
1823cb0b9 ocfs2: Add suppor... |
6328 |
int ocfs2_cache_block_dealloc(struct ocfs2_cached_dealloc_ctxt *ctxt, |
74380c479 ocfs2: Free block... |
6329 6330 |
int type, int slot, u64 suballoc, u64 blkno, unsigned int bit) |
2b604351b ocfs2: simplify d... |
6331 6332 6333 6334 6335 6336 6337 6338 6339 6340 6341 |
{ int ret; struct ocfs2_per_slot_free_list *fl; struct ocfs2_cached_block_free *item; fl = ocfs2_find_per_slot_free_list(type, slot, ctxt); if (fl == NULL) { ret = -ENOMEM; mlog_errno(ret); goto out; } |
74380c479 ocfs2: Free block... |
6342 |
item = kzalloc(sizeof(*item), GFP_NOFS); |
2b604351b ocfs2: simplify d... |
6343 6344 6345 6346 6347 |
if (item == NULL) { ret = -ENOMEM; mlog_errno(ret); goto out; } |
a09d09b8f ocfs2: Remove mlo... |
6348 6349 6350 |
trace_ocfs2_cache_block_dealloc(type, slot, (unsigned long long)suballoc, (unsigned long long)blkno, bit); |
2b604351b ocfs2: simplify d... |
6351 |
|
74380c479 ocfs2: Free block... |
6352 |
item->free_bg = suballoc; |
2b604351b ocfs2: simplify d... |
6353 6354 6355 6356 6357 6358 6359 6360 6361 6362 |
item->free_blk = blkno; item->free_bit = bit; item->free_next = fl->f_first; fl->f_first = item; ret = 0; out: return ret; } |
59a5e416d ocfs2: plug trunc... |
6363 6364 6365 6366 6367 |
static int ocfs2_cache_extent_block_free(struct ocfs2_cached_dealloc_ctxt *ctxt, struct ocfs2_extent_block *eb) { return ocfs2_cache_block_dealloc(ctxt, EXTENT_ALLOC_SYSTEM_INODE, le16_to_cpu(eb->h_suballoc_slot), |
74380c479 ocfs2: Free block... |
6368 |
le64_to_cpu(eb->h_suballoc_loc), |
59a5e416d ocfs2: plug trunc... |
6369 6370 6371 |
le64_to_cpu(eb->h_blkno), le16_to_cpu(eb->h_suballoc_bit)); } |
2b4e30fbd ocfs2: Switch ove... |
6372 |
static int ocfs2_zero_func(handle_t *handle, struct buffer_head *bh) |
60b11392f ocfs2: zero tail ... |
6373 6374 6375 6376 6377 |
{ set_buffer_uptodate(bh); mark_buffer_dirty(bh); return 0; } |
6f70fa519 ocfs2: Add CoW su... |
6378 6379 6380 |
void ocfs2_map_and_dirty_page(struct inode *inode, handle_t *handle, unsigned int from, unsigned int to, struct page *page, int zero, u64 *phys) |
1d410a6e3 ocfs2: Small refa... |
6381 6382 6383 6384 6385 6386 6387 6388 |
{ int ret, partial = 0; ret = ocfs2_map_page_blocks(page, phys, inode, from, to, 0); if (ret) mlog_errno(ret); if (zero) |
eebd2aa35 Pagecache zeroing... |
6389 |
zero_user_segment(page, from, to); |
1d410a6e3 ocfs2: Small refa... |
6390 6391 6392 6393 6394 6395 |
/* * Need to set the buffers we zero'd into uptodate * here if they aren't - ocfs2_map_page_blocks() * might've skipped some */ |
2b4e30fbd ocfs2: Switch ove... |
6396 6397 6398 6399 6400 6401 6402 |
ret = walk_page_buffers(handle, page_buffers(page), from, to, &partial, ocfs2_zero_func); if (ret < 0) mlog_errno(ret); else if (ocfs2_should_order_data(inode)) { ret = ocfs2_jbd2_file_inode(handle, inode); |
1d410a6e3 ocfs2: Small refa... |
6403 6404 6405 6406 6407 6408 6409 6410 6411 |
if (ret < 0) mlog_errno(ret); } if (!partial) SetPageUptodate(page); flush_dcache_page(page); } |
35edec1d5 ocfs2: update tru... |
6412 6413 6414 |
static void ocfs2_zero_cluster_pages(struct inode *inode, loff_t start, loff_t end, struct page **pages, int numpages, u64 phys, handle_t *handle) |
60b11392f ocfs2: zero tail ... |
6415 |
{ |
1d410a6e3 ocfs2: Small refa... |
6416 |
int i; |
60b11392f ocfs2: zero tail ... |
6417 |
struct page *page; |
09cbfeaf1 mm, fs: get rid o... |
6418 |
unsigned int from, to = PAGE_SIZE; |
60b11392f ocfs2: zero tail ... |
6419 6420 6421 6422 6423 6424 |
struct super_block *sb = inode->i_sb; BUG_ON(!ocfs2_sparse_alloc(OCFS2_SB(sb))); if (numpages == 0) goto out; |
09cbfeaf1 mm, fs: get rid o... |
6425 |
to = PAGE_SIZE; |
60b11392f ocfs2: zero tail ... |
6426 6427 |
for(i = 0; i < numpages; i++) { page = pages[i]; |
09cbfeaf1 mm, fs: get rid o... |
6428 6429 6430 |
from = start & (PAGE_SIZE - 1); if ((end >> PAGE_SHIFT) == page->index) to = end & (PAGE_SIZE - 1); |
35edec1d5 ocfs2: update tru... |
6431 |
|
09cbfeaf1 mm, fs: get rid o... |
6432 6433 |
BUG_ON(from > PAGE_SIZE); BUG_ON(to > PAGE_SIZE); |
60b11392f ocfs2: zero tail ... |
6434 |
|
1d410a6e3 ocfs2: Small refa... |
6435 6436 |
ocfs2_map_and_dirty_page(inode, handle, from, to, page, 1, &phys); |
60b11392f ocfs2: zero tail ... |
6437 |
|
09cbfeaf1 mm, fs: get rid o... |
6438 |
start = (page->index + 1) << PAGE_SHIFT; |
60b11392f ocfs2: zero tail ... |
6439 6440 |
} out: |
1d410a6e3 ocfs2: Small refa... |
6441 6442 |
if (pages) ocfs2_unlock_and_free_pages(pages, numpages); |
60b11392f ocfs2: zero tail ... |
6443 |
} |
6f70fa519 ocfs2: Add CoW su... |
6444 6445 |
int ocfs2_grab_pages(struct inode *inode, loff_t start, loff_t end, struct page **pages, int *num) |
60b11392f ocfs2: zero tail ... |
6446 |
{ |
1d410a6e3 ocfs2: Small refa... |
6447 |
int numpages, ret = 0; |
60b11392f ocfs2: zero tail ... |
6448 6449 |
struct address_space *mapping = inode->i_mapping; unsigned long index; |
35edec1d5 ocfs2: update tru... |
6450 |
loff_t last_page_bytes; |
60b11392f ocfs2: zero tail ... |
6451 |
|
35edec1d5 ocfs2: update tru... |
6452 |
BUG_ON(start > end); |
60b11392f ocfs2: zero tail ... |
6453 |
|
1d410a6e3 ocfs2: Small refa... |
6454 |
numpages = 0; |
35edec1d5 ocfs2: update tru... |
6455 |
last_page_bytes = PAGE_ALIGN(end); |
09cbfeaf1 mm, fs: get rid o... |
6456 |
index = start >> PAGE_SHIFT; |
60b11392f ocfs2: zero tail ... |
6457 |
do { |
9b4c0ff32 ocfs2: Fix deadlo... |
6458 |
pages[numpages] = find_or_create_page(mapping, index, GFP_NOFS); |
60b11392f ocfs2: zero tail ... |
6459 6460 6461 6462 6463 6464 6465 6466 |
if (!pages[numpages]) { ret = -ENOMEM; mlog_errno(ret); goto out; } numpages++; index++; |
09cbfeaf1 mm, fs: get rid o... |
6467 |
} while (index < (last_page_bytes >> PAGE_SHIFT)); |
60b11392f ocfs2: zero tail ... |
6468 6469 6470 |
out: if (ret != 0) { |
1d410a6e3 ocfs2: Small refa... |
6471 6472 |
if (pages) ocfs2_unlock_and_free_pages(pages, numpages); |
60b11392f ocfs2: zero tail ... |
6473 6474 6475 6476 6477 6478 6479 |
numpages = 0; } *num = numpages; return ret; } |
6f70fa519 ocfs2: Add CoW su... |
6480 6481 6482 6483 6484 6485 6486 6487 6488 6489 |
static int ocfs2_grab_eof_pages(struct inode *inode, loff_t start, loff_t end, struct page **pages, int *num) { struct super_block *sb = inode->i_sb; BUG_ON(start >> OCFS2_SB(sb)->s_clustersize_bits != (end - 1) >> OCFS2_SB(sb)->s_clustersize_bits); return ocfs2_grab_pages(inode, start, end, pages, num); } |
60b11392f ocfs2: zero tail ... |
6490 6491 6492 6493 6494 6495 6496 6497 6498 |
/* * Zero the area past i_size but still within an allocated * cluster. This avoids exposing nonzero data on subsequent file * extends. * * We need to call this before i_size is updated on the inode because * otherwise block_write_full_page() will skip writeout of pages past * i_size. The new_i_size parameter is passed for this reason. */ |
35edec1d5 ocfs2: update tru... |
6499 6500 |
int ocfs2_zero_range_for_truncate(struct inode *inode, handle_t *handle, u64 range_start, u64 range_end) |
60b11392f ocfs2: zero tail ... |
6501 |
{ |
1d410a6e3 ocfs2: Small refa... |
6502 |
int ret = 0, numpages; |
60b11392f ocfs2: zero tail ... |
6503 6504 |
struct page **pages = NULL; u64 phys; |
1d410a6e3 ocfs2: Small refa... |
6505 6506 |
unsigned int ext_flags; struct super_block *sb = inode->i_sb; |
60b11392f ocfs2: zero tail ... |
6507 6508 6509 6510 6511 |
/* * File systems which don't support sparse files zero on every * extend. */ |
1d410a6e3 ocfs2: Small refa... |
6512 |
if (!ocfs2_sparse_alloc(OCFS2_SB(sb))) |
60b11392f ocfs2: zero tail ... |
6513 |
return 0; |
1d410a6e3 ocfs2: Small refa... |
6514 |
pages = kcalloc(ocfs2_pages_per_cluster(sb), |
60b11392f ocfs2: zero tail ... |
6515 6516 6517 6518 6519 6520 |
sizeof(struct page *), GFP_NOFS); if (pages == NULL) { ret = -ENOMEM; mlog_errno(ret); goto out; } |
1d410a6e3 ocfs2: Small refa... |
6521 6522 6523 6524 6525 6526 |
if (range_start == range_end) goto out; ret = ocfs2_extent_map_get_blocks(inode, range_start >> sb->s_blocksize_bits, &phys, NULL, &ext_flags); |
60b11392f ocfs2: zero tail ... |
6527 6528 6529 6530 |
if (ret) { mlog_errno(ret); goto out; } |
1d410a6e3 ocfs2: Small refa... |
6531 6532 6533 6534 6535 |
/* * Tail is a hole, or is marked unwritten. In either case, we * can count on read and write to return/push zero's. */ if (phys == 0 || ext_flags & OCFS2_EXT_UNWRITTEN) |
60b11392f ocfs2: zero tail ... |
6536 |
goto out; |
1d410a6e3 ocfs2: Small refa... |
6537 6538 6539 6540 6541 6542 |
ret = ocfs2_grab_eof_pages(inode, range_start, range_end, pages, &numpages); if (ret) { mlog_errno(ret); goto out; } |
35edec1d5 ocfs2: update tru... |
6543 6544 |
ocfs2_zero_cluster_pages(inode, range_start, range_end, pages, numpages, phys, handle); |
60b11392f ocfs2: zero tail ... |
6545 6546 6547 6548 6549 6550 |
/* * Initiate writeout of the pages we zero'd here. We don't * wait on them - the truncate_inode_pages() call later will * do that for us. */ |
2cfd30adf ocfs: stop using ... |
6551 6552 |
ret = filemap_fdatawrite_range(inode->i_mapping, range_start, range_end - 1); |
60b11392f ocfs2: zero tail ... |
6553 6554 6555 6556 |
if (ret) mlog_errno(ret); out: |
d787ab097 ocfs2: remove kfr... |
6557 |
kfree(pages); |
60b11392f ocfs2: zero tail ... |
6558 6559 6560 |
return ret; } |
fdd77704a ocfs2: reserve in... |
6561 6562 |
static void ocfs2_zero_dinode_id2_with_xattr(struct inode *inode, struct ocfs2_dinode *di) |
1afc32b95 ocfs2: Write supp... |
6563 6564 |
{ unsigned int blocksize = 1 << inode->i_sb->s_blocksize_bits; |
fdd77704a ocfs2: reserve in... |
6565 |
unsigned int xattrsize = le16_to_cpu(di->i_xattr_inline_size); |
1afc32b95 ocfs2: Write supp... |
6566 |
|
fdd77704a ocfs2: reserve in... |
6567 6568 6569 6570 6571 6572 6573 |
if (le16_to_cpu(di->i_dyn_features) & OCFS2_INLINE_XATTR_FL) memset(&di->id2, 0, blocksize - offsetof(struct ocfs2_dinode, id2) - xattrsize); else memset(&di->id2, 0, blocksize - offsetof(struct ocfs2_dinode, id2)); |
1afc32b95 ocfs2: Write supp... |
6574 |
} |
5b6a3a2b4 ocfs2: Write supp... |
6575 6576 6577 |
void ocfs2_dinode_new_extent_list(struct inode *inode, struct ocfs2_dinode *di) { |
fdd77704a ocfs2: reserve in... |
6578 |
ocfs2_zero_dinode_id2_with_xattr(inode, di); |
5b6a3a2b4 ocfs2: Write supp... |
6579 6580 |
di->id2.i_list.l_tree_depth = 0; di->id2.i_list.l_next_free_rec = 0; |
fdd77704a ocfs2: reserve in... |
6581 6582 |
di->id2.i_list.l_count = cpu_to_le16( ocfs2_extent_recs_per_inode_with_xattr(inode->i_sb, di)); |
5b6a3a2b4 ocfs2: Write supp... |
6583 |
} |
1afc32b95 ocfs2: Write supp... |
6584 6585 6586 6587 6588 6589 6590 6591 6592 6593 6594 6595 6596 6597 |
void ocfs2_set_inode_data_inline(struct inode *inode, struct ocfs2_dinode *di) { struct ocfs2_inode_info *oi = OCFS2_I(inode); struct ocfs2_inline_data *idata = &di->id2.i_data; spin_lock(&oi->ip_lock); oi->ip_dyn_features |= OCFS2_INLINE_DATA_FL; di->i_dyn_features = cpu_to_le16(oi->ip_dyn_features); spin_unlock(&oi->ip_lock); /* * We clear the entire i_data structure here so that all * fields can be properly initialized. */ |
fdd77704a ocfs2: reserve in... |
6598 |
ocfs2_zero_dinode_id2_with_xattr(inode, di); |
1afc32b95 ocfs2: Write supp... |
6599 |
|
fdd77704a ocfs2: reserve in... |
6600 6601 |
idata->id_count = cpu_to_le16( ocfs2_max_inline_data_with_xattr(inode->i_sb, di)); |
1afc32b95 ocfs2: Write supp... |
6602 6603 6604 6605 6606 6607 |
} int ocfs2_convert_inline_data_to_extents(struct inode *inode, struct buffer_head *di_bh) { int ret, i, has_data, num_pages = 0; |
fb951eb5e ocfs2: free alloc... |
6608 6609 |
int need_free = 0; u32 bit_off, num; |
1afc32b95 ocfs2: Write supp... |
6610 6611 6612 6613 6614 |
handle_t *handle; u64 uninitialized_var(block); struct ocfs2_inode_info *oi = OCFS2_I(inode); struct ocfs2_super *osb = OCFS2_SB(inode->i_sb); struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data; |
1afc32b95 ocfs2: Write supp... |
6615 6616 6617 |
struct ocfs2_alloc_context *data_ac = NULL; struct page **pages = NULL; loff_t end = osb->s_clustersize; |
f99b9b7cc ocfs2: Make ocfs2... |
6618 |
struct ocfs2_extent_tree et; |
a90714c15 ocfs2: Add quota ... |
6619 |
int did_quota = 0; |
1afc32b95 ocfs2: Write supp... |
6620 6621 6622 6623 6624 6625 6626 6627 6628 |
has_data = i_size_read(inode) ? 1 : 0; if (has_data) { pages = kcalloc(ocfs2_pages_per_cluster(osb->sb), sizeof(struct page *), GFP_NOFS); if (pages == NULL) { ret = -ENOMEM; mlog_errno(ret); |
3cc79b795 ocfs2: less funct... |
6629 |
return ret; |
1afc32b95 ocfs2: Write supp... |
6630 6631 6632 6633 6634 |
} ret = ocfs2_reserve_clusters(osb, 1, &data_ac); if (ret) { mlog_errno(ret); |
3cc79b795 ocfs2: less funct... |
6635 |
goto free_pages; |
1afc32b95 ocfs2: Write supp... |
6636 6637 |
} } |
a90714c15 ocfs2: Add quota ... |
6638 6639 |
handle = ocfs2_start_trans(osb, ocfs2_inline_to_extents_credits(osb->sb)); |
1afc32b95 ocfs2: Write supp... |
6640 6641 6642 |
if (IS_ERR(handle)) { ret = PTR_ERR(handle); mlog_errno(ret); |
15eba0fe3 ocfs2: fix journa... |
6643 |
goto out; |
1afc32b95 ocfs2: Write supp... |
6644 |
} |
0cf2f7632 ocfs2: Pass struc... |
6645 |
ret = ocfs2_journal_access_di(handle, INODE_CACHE(inode), di_bh, |
13723d00e ocfs2: Use metada... |
6646 |
OCFS2_JOURNAL_ACCESS_WRITE); |
1afc32b95 ocfs2: Write supp... |
6647 6648 6649 6650 6651 6652 |
if (ret) { mlog_errno(ret); goto out_commit; } if (has_data) { |
1afc32b95 ocfs2: Write supp... |
6653 6654 |
unsigned int page_end; u64 phys; |
5dd4056db dquot: cleanup sp... |
6655 6656 6657 |
ret = dquot_alloc_space_nodirty(inode, ocfs2_clusters_to_bytes(osb->sb, 1)); if (ret) |
a90714c15 ocfs2: Add quota ... |
6658 |
goto out_commit; |
a90714c15 ocfs2: Add quota ... |
6659 |
did_quota = 1; |
4fe370afa ocfs2: use alloca... |
6660 |
data_ac->ac_resv = &OCFS2_I(inode)->ip_la_data_resv; |
1ed9b777f ocfs2: ocfs2_clai... |
6661 |
ret = ocfs2_claim_clusters(handle, data_ac, 1, &bit_off, |
1afc32b95 ocfs2: Write supp... |
6662 6663 6664 6665 6666 6667 6668 6669 6670 6671 6672 6673 6674 6675 6676 6677 6678 |
&num); if (ret) { mlog_errno(ret); goto out_commit; } /* * Save two copies, one for insert, and one that can * be changed by ocfs2_map_and_dirty_page() below. */ block = phys = ocfs2_clusters_to_blocks(inode->i_sb, bit_off); /* * Non sparse file systems zero on extend, so no need * to do that now. */ if (!ocfs2_sparse_alloc(osb) && |
09cbfeaf1 mm, fs: get rid o... |
6679 6680 |
PAGE_SIZE < osb->s_clustersize) end = PAGE_SIZE; |
1afc32b95 ocfs2: Write supp... |
6681 6682 6683 6684 |
ret = ocfs2_grab_eof_pages(inode, 0, end, pages, &num_pages); if (ret) { mlog_errno(ret); |
fb951eb5e ocfs2: free alloc... |
6685 |
need_free = 1; |
1afc32b95 ocfs2: Write supp... |
6686 6687 6688 6689 6690 6691 6692 6693 6694 6695 |
goto out_commit; } /* * This should populate the 1st page for us and mark * it up to date. */ ret = ocfs2_read_inline_data(inode, pages[0], di_bh); if (ret) { mlog_errno(ret); |
fb951eb5e ocfs2: free alloc... |
6696 |
need_free = 1; |
15eba0fe3 ocfs2: fix journa... |
6697 |
goto out_unlock; |
1afc32b95 ocfs2: Write supp... |
6698 |
} |
09cbfeaf1 mm, fs: get rid o... |
6699 6700 |
page_end = PAGE_SIZE; if (PAGE_SIZE > osb->s_clustersize) |
1afc32b95 ocfs2: Write supp... |
6701 6702 6703 6704 6705 6706 6707 6708 6709 6710 6711 |
page_end = osb->s_clustersize; for (i = 0; i < num_pages; i++) ocfs2_map_and_dirty_page(inode, handle, 0, page_end, pages[i], i > 0, &phys); } spin_lock(&oi->ip_lock); oi->ip_dyn_features &= ~OCFS2_INLINE_DATA_FL; di->i_dyn_features = cpu_to_le16(oi->ip_dyn_features); spin_unlock(&oi->ip_lock); |
2931cdcb4 ocfs2: improve fs... |
6712 |
ocfs2_update_inode_fsync_trans(handle, inode, 1); |
5b6a3a2b4 ocfs2: Write supp... |
6713 |
ocfs2_dinode_new_extent_list(inode, di); |
1afc32b95 ocfs2: Write supp... |
6714 6715 6716 6717 6718 6719 6720 6721 6722 |
ocfs2_journal_dirty(handle, di_bh); if (has_data) { /* * An error at this point should be extremely rare. If * this proves to be false, we could always re-build * the in-inode data from our pages. */ |
5e404e9ed ocfs2: Pass ocfs2... |
6723 |
ocfs2_init_dinode_extent_tree(&et, INODE_CACHE(inode), di_bh); |
cc79d8c19 ocfs2: ocfs2_inse... |
6724 |
ret = ocfs2_insert_extent(handle, &et, 0, block, 1, 0, NULL); |
1afc32b95 ocfs2: Write supp... |
6725 6726 |
if (ret) { mlog_errno(ret); |
fb951eb5e ocfs2: free alloc... |
6727 |
need_free = 1; |
15eba0fe3 ocfs2: fix journa... |
6728 |
goto out_unlock; |
1afc32b95 ocfs2: Write supp... |
6729 6730 6731 6732 |
} inode->i_blocks = ocfs2_inode_sector_count(inode); } |
15eba0fe3 ocfs2: fix journa... |
6733 6734 6735 |
out_unlock: if (pages) ocfs2_unlock_and_free_pages(pages, num_pages); |
1afc32b95 ocfs2: Write supp... |
6736 |
out_commit: |
a90714c15 ocfs2: Add quota ... |
6737 |
if (ret < 0 && did_quota) |
5dd4056db dquot: cleanup sp... |
6738 |
dquot_free_space_nodirty(inode, |
a90714c15 ocfs2: Add quota ... |
6739 |
ocfs2_clusters_to_bytes(osb->sb, 1)); |
fb951eb5e ocfs2: free alloc... |
6740 6741 6742 6743 6744 6745 6746 6747 6748 6749 6750 |
if (need_free) { if (data_ac->ac_which == OCFS2_AC_USE_LOCAL) ocfs2_free_local_alloc_bits(osb, handle, data_ac, bit_off, num); else ocfs2_free_clusters(handle, data_ac->ac_inode, data_ac->ac_bh, ocfs2_clusters_to_blocks(osb->sb, bit_off), num); } |
1afc32b95 ocfs2: Write supp... |
6751 |
ocfs2_commit_trans(osb, handle); |
15eba0fe3 ocfs2: fix journa... |
6752 |
out: |
1afc32b95 ocfs2: Write supp... |
6753 6754 |
if (data_ac) ocfs2_free_alloc_context(data_ac); |
3cc79b795 ocfs2: less funct... |
6755 |
free_pages: |
fd90d4dfb ocfs2: delete unn... |
6756 |
kfree(pages); |
1afc32b95 ocfs2: Write supp... |
6757 6758 |
return ret; } |
ccd979bdb [PATCH] OCFS2: Th... |
6759 6760 6761 6762 6763 6764 6765 6766 |
/* * It is expected, that by the time you call this function, * inode->i_size and fe->i_size have been adjusted. * * WARNING: This will kfree the truncate context */ int ocfs2_commit_truncate(struct ocfs2_super *osb, struct inode *inode, |
78f94673d Ocfs2: Optimize o... |
6767 |
struct buffer_head *di_bh) |
ccd979bdb [PATCH] OCFS2: Th... |
6768 |
{ |
78f94673d Ocfs2: Optimize o... |
6769 6770 |
int status = 0, i, flags = 0; u32 new_highest_cpos, range, trunc_cpos, trunc_len, phys_cpos, coff; |
bcbbb24a6 ocfs2: Decrement ... |
6771 |
u64 blkno = 0; |
ccd979bdb [PATCH] OCFS2: Th... |
6772 |
struct ocfs2_extent_list *el; |
78f94673d Ocfs2: Optimize o... |
6773 |
struct ocfs2_extent_rec *rec; |
dcd0538ff ocfs2: sparse b-t... |
6774 |
struct ocfs2_path *path = NULL; |
78f94673d Ocfs2: Optimize o... |
6775 6776 6777 6778 6779 |
struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data; struct ocfs2_extent_list *root_el = &(di->id2.i_list); u64 refcount_loc = le64_to_cpu(di->i_refcount_loc); struct ocfs2_extent_tree et; struct ocfs2_cached_dealloc_ctxt dealloc; |
f62f12b3a ocfs2: reflink: f... |
6780 |
struct ocfs2_refcount_tree *ref_tree = NULL; |
ccd979bdb [PATCH] OCFS2: Th... |
6781 |
|
78f94673d Ocfs2: Optimize o... |
6782 6783 |
ocfs2_init_dinode_extent_tree(&et, INODE_CACHE(inode), di_bh); ocfs2_init_dealloc_ctxt(&dealloc); |
dcd0538ff ocfs2: sparse b-t... |
6784 |
new_highest_cpos = ocfs2_clusters_for_bytes(osb->sb, |
ccd979bdb [PATCH] OCFS2: Th... |
6785 |
i_size_read(inode)); |
78f94673d Ocfs2: Optimize o... |
6786 |
path = ocfs2_new_path(di_bh, &di->id2.i_list, |
13723d00e ocfs2: Use metada... |
6787 |
ocfs2_journal_access_di); |
dcd0538ff ocfs2: sparse b-t... |
6788 6789 6790 6791 6792 |
if (!path) { status = -ENOMEM; mlog_errno(status); goto bail; } |
834189788 ocfs2: Cache exte... |
6793 6794 |
ocfs2_extent_map_trunc(inode, new_highest_cpos); |
ccd979bdb [PATCH] OCFS2: Th... |
6795 |
start: |
dcd0538ff ocfs2: sparse b-t... |
6796 |
/* |
3a0782d09 ocfs2: teach exte... |
6797 6798 6799 6800 6801 6802 6803 6804 |
* Check that we still have allocation to delete. */ if (OCFS2_I(inode)->ip_clusters == 0) { status = 0; goto bail; } /* |
dcd0538ff ocfs2: sparse b-t... |
6805 6806 |
* Truncate always works against the rightmost tree branch. */ |
facdb77f5 ocfs2: ocfs2_find... |
6807 |
status = ocfs2_find_path(INODE_CACHE(inode), path, UINT_MAX); |
dcd0538ff ocfs2: sparse b-t... |
6808 6809 6810 |
if (status) { mlog_errno(status); goto bail; |
ccd979bdb [PATCH] OCFS2: Th... |
6811 |
} |
a09d09b8f ocfs2: Remove mlo... |
6812 6813 6814 6815 6816 |
trace_ocfs2_commit_truncate( (unsigned long long)OCFS2_I(inode)->ip_blkno, new_highest_cpos, OCFS2_I(inode)->ip_clusters, path->p_tree_depth); |
dcd0538ff ocfs2: sparse b-t... |
6817 6818 6819 6820 6821 6822 6823 6824 6825 6826 6827 6828 6829 |
/* * By now, el will point to the extent list on the bottom most * portion of this tree. Only the tail record is considered in * each pass. * * We handle the following cases, in order: * - empty extent: delete the remaining branch * - remove the entire record * - remove a partial record * - no record needs to be removed (truncate has completed) */ el = path_leaf_el(path); |
3a0782d09 ocfs2: teach exte... |
6830 6831 6832 6833 6834 6835 6836 6837 6838 |
if (le16_to_cpu(el->l_next_free_rec) == 0) { ocfs2_error(inode->i_sb, "Inode %llu has empty extent block at %llu ", (unsigned long long)OCFS2_I(inode)->ip_blkno, (unsigned long long)path_leaf_bh(path)->b_blocknr); status = -EROFS; goto bail; } |
ccd979bdb [PATCH] OCFS2: Th... |
6839 |
i = le16_to_cpu(el->l_next_free_rec) - 1; |
78f94673d Ocfs2: Optimize o... |
6840 6841 6842 6843 6844 6845 6846 6847 6848 6849 |
rec = &el->l_recs[i]; flags = rec->e_flags; range = le32_to_cpu(rec->e_cpos) + ocfs2_rec_clusters(el, rec); if (i == 0 && ocfs2_is_empty_extent(rec)) { /* * Lower levels depend on this never happening, but it's best * to check it up here before changing the tree. */ if (root_el->l_tree_depth && rec->e_int_clusters == 0) { |
d0c97d52f ocfs2: do not set... |
6850 |
mlog(ML_ERROR, "Inode %lu has an empty " |
78f94673d Ocfs2: Optimize o... |
6851 6852 6853 |
"extent record, depth %u ", inode->i_ino, le16_to_cpu(root_el->l_tree_depth)); |
d0c97d52f ocfs2: do not set... |
6854 6855 6856 6857 6858 6859 6860 6861 6862 6863 6864 6865 6866 |
status = ocfs2_remove_rightmost_empty_extent(osb, &et, path, &dealloc); if (status) { mlog_errno(status); goto bail; } ocfs2_reinit_path(path, 1); goto start; } else { trunc_cpos = le32_to_cpu(rec->e_cpos); trunc_len = 0; blkno = 0; |
78f94673d Ocfs2: Optimize o... |
6867 |
} |
78f94673d Ocfs2: Optimize o... |
6868 6869 6870 6871 6872 6873 6874 |
} else if (le32_to_cpu(rec->e_cpos) >= new_highest_cpos) { /* * Truncate entire record. */ trunc_cpos = le32_to_cpu(rec->e_cpos); trunc_len = ocfs2_rec_clusters(el, rec); blkno = le64_to_cpu(rec->e_blkno); |
dcd0538ff ocfs2: sparse b-t... |
6875 |
} else if (range > new_highest_cpos) { |
78f94673d Ocfs2: Optimize o... |
6876 6877 6878 6879 6880 6881 6882 6883 6884 |
/* * Partial truncate. it also should be * the last truncate we're doing. */ trunc_cpos = new_highest_cpos; trunc_len = range - new_highest_cpos; coff = new_highest_cpos - le32_to_cpu(rec->e_cpos); blkno = le64_to_cpu(rec->e_blkno) + ocfs2_clusters_to_blocks(inode->i_sb, coff); |
dcd0538ff ocfs2: sparse b-t... |
6885 |
} else { |
78f94673d Ocfs2: Optimize o... |
6886 6887 6888 |
/* * Truncate completed, leave happily. */ |
dcd0538ff ocfs2: sparse b-t... |
6889 6890 6891 |
status = 0; goto bail; } |
ccd979bdb [PATCH] OCFS2: Th... |
6892 |
|
78f94673d Ocfs2: Optimize o... |
6893 |
phys_cpos = ocfs2_blocks_to_clusters(inode->i_sb, blkno); |
bcbbb24a6 ocfs2: Decrement ... |
6894 |
|
f62f12b3a ocfs2: reflink: f... |
6895 6896 6897 6898 6899 6900 6901 6902 |
if ((flags & OCFS2_EXT_REFCOUNTED) && trunc_len && !ref_tree) { status = ocfs2_lock_refcount_tree(osb, refcount_loc, 1, &ref_tree, NULL); if (status) { mlog_errno(status); goto bail; } } |
78f94673d Ocfs2: Optimize o... |
6903 6904 |
status = ocfs2_remove_btree_range(inode, &et, trunc_cpos, phys_cpos, trunc_len, flags, &dealloc, |
f62f12b3a ocfs2: reflink: f... |
6905 |
refcount_loc, true); |
ccd979bdb [PATCH] OCFS2: Th... |
6906 6907 6908 6909 |
if (status < 0) { mlog_errno(status); goto bail; } |
dcd0538ff ocfs2: sparse b-t... |
6910 6911 6912 |
ocfs2_reinit_path(path, 1); /* |
3a0782d09 ocfs2: teach exte... |
6913 6914 |
* The check above will catch the case where we've truncated * away all allocation. |
dcd0538ff ocfs2: sparse b-t... |
6915 |
*/ |
3a0782d09 ocfs2: teach exte... |
6916 |
goto start; |
ccd979bdb [PATCH] OCFS2: Th... |
6917 |
bail: |
f62f12b3a ocfs2: reflink: f... |
6918 6919 |
if (ref_tree) ocfs2_unlock_refcount_tree(osb, ref_tree, 1); |
ccd979bdb [PATCH] OCFS2: Th... |
6920 6921 |
ocfs2_schedule_truncate_log_flush(osb, 1); |
78f94673d Ocfs2: Optimize o... |
6922 |
ocfs2_run_deallocs(osb, &dealloc); |
59a5e416d ocfs2: plug trunc... |
6923 |
|
dcd0538ff ocfs2: sparse b-t... |
6924 |
ocfs2_free_path(path); |
ccd979bdb [PATCH] OCFS2: Th... |
6925 |
|
ccd979bdb [PATCH] OCFS2: Th... |
6926 6927 |
return status; } |
ccd979bdb [PATCH] OCFS2: Th... |
6928 |
/* |
1afc32b95 ocfs2: Write supp... |
6929 6930 6931 6932 6933 6934 6935 6936 6937 6938 6939 6940 6941 6942 |
* 'start' is inclusive, 'end' is not. */ int ocfs2_truncate_inline(struct inode *inode, struct buffer_head *di_bh, unsigned int start, unsigned int end, int trunc) { int ret; unsigned int numbytes; handle_t *handle; struct ocfs2_super *osb = OCFS2_SB(inode->i_sb); struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data; struct ocfs2_inline_data *idata = &di->id2.i_data; if (end > i_size_read(inode)) end = i_size_read(inode); |
d62e74be1 ocfs2: fix issue ... |
6943 |
BUG_ON(start > end); |
1afc32b95 ocfs2: Write supp... |
6944 6945 6946 6947 6948 |
if (!(OCFS2_I(inode)->ip_dyn_features & OCFS2_INLINE_DATA_FL) || !(le16_to_cpu(di->i_dyn_features) & OCFS2_INLINE_DATA_FL) || !ocfs2_supports_inline_data(osb)) { ocfs2_error(inode->i_sb, |
7ecef14ab ocfs2: neaten do_... |
6949 6950 |
"Inline data flags for inode %llu don't agree! Disk: 0x%x, Memory: 0x%x, Superblock: 0x%x ", |
1afc32b95 ocfs2: Write supp... |
6951 6952 6953 6954 6955 6956 6957 6958 6959 6960 6961 6962 6963 6964 |
(unsigned long long)OCFS2_I(inode)->ip_blkno, le16_to_cpu(di->i_dyn_features), OCFS2_I(inode)->ip_dyn_features, osb->s_feature_incompat); ret = -EROFS; goto out; } handle = ocfs2_start_trans(osb, OCFS2_INODE_UPDATE_CREDITS); if (IS_ERR(handle)) { ret = PTR_ERR(handle); mlog_errno(ret); goto out; } |
0cf2f7632 ocfs2: Pass struc... |
6965 |
ret = ocfs2_journal_access_di(handle, INODE_CACHE(inode), di_bh, |
13723d00e ocfs2: Use metada... |
6966 |
OCFS2_JOURNAL_ACCESS_WRITE); |
1afc32b95 ocfs2: Write supp... |
6967 6968 6969 6970 6971 6972 6973 6974 6975 6976 6977 6978 6979 6980 6981 6982 6983 6984 6985 6986 |
if (ret) { mlog_errno(ret); goto out_commit; } numbytes = end - start; memset(idata->id_data + start, 0, numbytes); /* * No need to worry about the data page here - it's been * truncated already and inline data doesn't need it for * pushing zero's to disk, so we'll let readpage pick it up * later. */ if (trunc) { i_size_write(inode, start); di->i_size = cpu_to_le64(start); } inode->i_blocks = ocfs2_inode_sector_count(inode); |
078cd8279 fs: Replace CURRE... |
6987 |
inode->i_ctime = inode->i_mtime = current_time(inode); |
1afc32b95 ocfs2: Write supp... |
6988 6989 6990 |
di->i_ctime = di->i_mtime = cpu_to_le64(inode->i_ctime.tv_sec); di->i_ctime_nsec = di->i_mtime_nsec = cpu_to_le32(inode->i_ctime.tv_nsec); |
6fdb702d6 ocfs2: call ocfs2... |
6991 |
ocfs2_update_inode_fsync_trans(handle, inode, 1); |
1afc32b95 ocfs2: Write supp... |
6992 6993 6994 6995 6996 6997 6998 6999 |
ocfs2_journal_dirty(handle, di_bh); out_commit: ocfs2_commit_trans(osb, handle); out: return ret; } |
e80de36d8 ocfs2: Add ocfs2_... |
7000 7001 7002 |
static int ocfs2_trim_extent(struct super_block *sb, struct ocfs2_group_desc *gd, |
105ddc93f ocfs2: fstrim: Fi... |
7003 |
u64 group, u32 start, u32 count) |
e80de36d8 ocfs2: Add ocfs2_... |
7004 7005 |
{ u64 discard, bcount; |
105ddc93f ocfs2: fstrim: Fi... |
7006 |
struct ocfs2_super *osb = OCFS2_SB(sb); |
e80de36d8 ocfs2: Add ocfs2_... |
7007 7008 |
bcount = ocfs2_clusters_to_blocks(sb, count); |
105ddc93f ocfs2: fstrim: Fi... |
7009 7010 7011 7012 7013 7014 7015 7016 7017 7018 7019 7020 |
discard = ocfs2_clusters_to_blocks(sb, start); /* * For the first cluster group, the gd->bg_blkno is not at the start * of the group, but at an offset from the start. If we add it while * calculating discard for first group, we will wrongly start fstrim a * few blocks after the desried start block and the range can cross * over into the next cluster group. So, add it only if this is not * the first cluster group. */ if (group != osb->first_cluster_group_blkno) discard += le64_to_cpu(gd->bg_blkno); |
e80de36d8 ocfs2: Add ocfs2_... |
7021 |
|
10fca35ff ocfs2: Add trace ... |
7022 |
trace_ocfs2_trim_extent(sb, (unsigned long long)discard, bcount); |
e80de36d8 ocfs2: Add ocfs2_... |
7023 7024 7025 7026 |
return sb_issue_discard(sb, discard, bcount, GFP_NOFS, 0); } static int ocfs2_trim_group(struct super_block *sb, |
105ddc93f ocfs2: fstrim: Fi... |
7027 |
struct ocfs2_group_desc *gd, u64 group, |
e80de36d8 ocfs2: Add ocfs2_... |
7028 7029 7030 7031 7032 7033 7034 |
u32 start, u32 max, u32 minbits) { int ret = 0, count = 0, next; void *bitmap = gd->bg_bitmap; if (le16_to_cpu(gd->bg_free_bits_count) < minbits) return 0; |
10fca35ff ocfs2: Add trace ... |
7035 7036 |
trace_ocfs2_trim_group((unsigned long long)le64_to_cpu(gd->bg_blkno), start, max, minbits); |
e80de36d8 ocfs2: Add ocfs2_... |
7037 7038 7039 7040 7041 7042 7043 |
while (start < max) { start = ocfs2_find_next_zero_bit(bitmap, max, start); if (start >= max) break; next = ocfs2_find_next_bit(bitmap, max, start); if ((next - start) >= minbits) { |
105ddc93f ocfs2: fstrim: Fi... |
7044 |
ret = ocfs2_trim_extent(sb, gd, group, |
e80de36d8 ocfs2: Add ocfs2_... |
7045 7046 7047 7048 7049 7050 7051 7052 7053 7054 7055 7056 7057 7058 7059 7060 7061 7062 7063 7064 7065 7066 7067 7068 7069 7070 7071 7072 7073 7074 7075 7076 7077 7078 7079 7080 7081 7082 7083 |
start, next - start); if (ret < 0) { mlog_errno(ret); break; } count += next - start; } start = next + 1; if (fatal_signal_pending(current)) { count = -ERESTARTSYS; break; } if ((le16_to_cpu(gd->bg_free_bits_count) - count) < minbits) break; } if (ret < 0) count = ret; return count; } int ocfs2_trim_fs(struct super_block *sb, struct fstrim_range *range) { struct ocfs2_super *osb = OCFS2_SB(sb); u64 start, len, trimmed, first_group, last_group, group; int ret, cnt; u32 first_bit, last_bit, minlen; struct buffer_head *main_bm_bh = NULL; struct inode *main_bm_inode = NULL; struct buffer_head *gd_bh = NULL; struct ocfs2_dinode *main_bm; struct ocfs2_group_desc *gd = NULL; start = range->start >> osb->s_clustersize_bits; len = range->len >> osb->s_clustersize_bits; minlen = range->minlen >> osb->s_clustersize_bits; |
e80de36d8 ocfs2: Add ocfs2_... |
7084 |
|
aa89762c5 ocfs2: return EIN... |
7085 |
if (minlen >= osb->bitmap_cpg || range->len < sb->s_blocksize) |
e80de36d8 ocfs2: Add ocfs2_... |
7086 7087 7088 7089 7090 7091 7092 7093 7094 7095 |
return -EINVAL; main_bm_inode = ocfs2_get_system_file_inode(osb, GLOBAL_BITMAP_SYSTEM_INODE, OCFS2_INVALID_SLOT); if (!main_bm_inode) { ret = -EIO; mlog_errno(ret); goto out; } |
5955102c9 wrappers for ->i_... |
7096 |
inode_lock(main_bm_inode); |
e80de36d8 ocfs2: Add ocfs2_... |
7097 7098 7099 7100 7101 7102 7103 7104 7105 7106 7107 7108 |
ret = ocfs2_inode_lock(main_bm_inode, &main_bm_bh, 0); if (ret < 0) { mlog_errno(ret); goto out_mutex; } main_bm = (struct ocfs2_dinode *)main_bm_bh->b_data; if (start >= le32_to_cpu(main_bm->i_clusters)) { ret = -EINVAL; goto out_unlock; } |
aa89762c5 ocfs2: return EIN... |
7109 |
len = range->len >> osb->s_clustersize_bits; |
e80de36d8 ocfs2: Add ocfs2_... |
7110 7111 |
if (start + len > le32_to_cpu(main_bm->i_clusters)) len = le32_to_cpu(main_bm->i_clusters) - start; |
10fca35ff ocfs2: Add trace ... |
7112 |
trace_ocfs2_trim_fs(start, len, minlen); |
e80de36d8 ocfs2: Add ocfs2_... |
7113 7114 7115 7116 7117 7118 7119 7120 |
/* Determine first and last group to examine based on start and len */ first_group = ocfs2_which_cluster_group(main_bm_inode, start); if (first_group == osb->first_cluster_group_blkno) first_bit = start; else first_bit = start - ocfs2_blocks_to_clusters(sb, first_group); last_group = ocfs2_which_cluster_group(main_bm_inode, start + len - 1); last_bit = osb->bitmap_cpg; |
aa89762c5 ocfs2: return EIN... |
7121 |
trimmed = 0; |
e80de36d8 ocfs2: Add ocfs2_... |
7122 7123 7124 7125 7126 7127 7128 7129 7130 7131 7132 7133 7134 7135 7136 |
for (group = first_group; group <= last_group;) { if (first_bit + len >= osb->bitmap_cpg) last_bit = osb->bitmap_cpg; else last_bit = first_bit + len; ret = ocfs2_read_group_descriptor(main_bm_inode, main_bm, group, &gd_bh); if (ret < 0) { mlog_errno(ret); break; } gd = (struct ocfs2_group_desc *)gd_bh->b_data; |
105ddc93f ocfs2: fstrim: Fi... |
7137 7138 |
cnt = ocfs2_trim_group(sb, gd, group, first_bit, last_bit, minlen); |
e80de36d8 ocfs2: Add ocfs2_... |
7139 7140 7141 7142 7143 7144 7145 7146 7147 7148 7149 7150 7151 7152 7153 7154 7155 7156 7157 7158 7159 |
brelse(gd_bh); gd_bh = NULL; if (cnt < 0) { ret = cnt; mlog_errno(ret); break; } trimmed += cnt; len -= osb->bitmap_cpg - first_bit; first_bit = 0; if (group == osb->first_cluster_group_blkno) group = ocfs2_clusters_to_blocks(sb, osb->bitmap_cpg); else group += ocfs2_clusters_to_blocks(sb, osb->bitmap_cpg); } range->len = trimmed * sb->s_blocksize; out_unlock: ocfs2_inode_unlock(main_bm_inode, 0); brelse(main_bm_bh); out_mutex: |
5955102c9 wrappers for ->i_... |
7160 |
inode_unlock(main_bm_inode); |
e80de36d8 ocfs2: Add ocfs2_... |
7161 7162 7163 7164 |
iput(main_bm_inode); out: return ret; } |