Commit | Line | Data |
---|---|---|
1da177e4 | 1 | /* |
7b718769 | 2 | * Copyright (c) 2000-2005 Silicon Graphics, Inc. |
f5ea1100 | 3 | * Copyright (c) 2013 Red Hat, Inc. |
7b718769 | 4 | * All Rights Reserved. |
1da177e4 | 5 | * |
7b718769 NS |
6 | * This program is free software; you can redistribute it and/or |
7 | * modify it under the terms of the GNU General Public License as | |
1da177e4 LT |
8 | * published by the Free Software Foundation. |
9 | * | |
7b718769 NS |
10 | * This program is distributed in the hope that it would be useful, |
11 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
12 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
13 | * GNU General Public License for more details. | |
1da177e4 | 14 | * |
7b718769 NS |
15 | * You should have received a copy of the GNU General Public License |
16 | * along with this program; if not, write the Free Software Foundation, | |
17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA | |
1da177e4 | 18 | */ |
1da177e4 | 19 | #include "xfs.h" |
a844f451 | 20 | #include "xfs_fs.h" |
70a9883c | 21 | #include "xfs_shared.h" |
239880ef DC |
22 | #include "xfs_format.h" |
23 | #include "xfs_log_format.h" | |
24 | #include "xfs_trans_resv.h" | |
a844f451 | 25 | #include "xfs_bit.h" |
1da177e4 LT |
26 | #include "xfs_sb.h" |
27 | #include "xfs_ag.h" | |
1da177e4 | 28 | #include "xfs_mount.h" |
57062787 | 29 | #include "xfs_da_format.h" |
a844f451 | 30 | #include "xfs_da_btree.h" |
2b9ab5ab | 31 | #include "xfs_dir2.h" |
57926640 | 32 | #include "xfs_dir2_priv.h" |
1da177e4 | 33 | #include "xfs_inode.h" |
239880ef | 34 | #include "xfs_trans.h" |
a844f451 NS |
35 | #include "xfs_inode_item.h" |
36 | #include "xfs_alloc.h" | |
1da177e4 | 37 | #include "xfs_bmap.h" |
1da177e4 LT |
38 | #include "xfs_attr.h" |
39 | #include "xfs_attr_leaf.h" | |
1da177e4 | 40 | #include "xfs_error.h" |
0b1b213f | 41 | #include "xfs_trace.h" |
f5ea1100 DC |
42 | #include "xfs_cksum.h" |
43 | #include "xfs_buf_item.h" | |
1da177e4 LT |
44 | |
45 | /* | |
46 | * xfs_da_btree.c | |
47 | * | |
48 | * Routines to implement directories as Btrees of hashed names. | |
49 | */ | |
50 | ||
51 | /*======================================================================== | |
52 | * Function prototypes for the kernel. | |
53 | *========================================================================*/ | |
54 | ||
55 | /* | |
56 | * Routines used for growing the Btree. | |
57 | */ | |
f5ea1100 | 58 | STATIC int xfs_da3_root_split(xfs_da_state_t *state, |
1da177e4 LT |
59 | xfs_da_state_blk_t *existing_root, |
60 | xfs_da_state_blk_t *new_child); | |
f5ea1100 | 61 | STATIC int xfs_da3_node_split(xfs_da_state_t *state, |
1da177e4 LT |
62 | xfs_da_state_blk_t *existing_blk, |
63 | xfs_da_state_blk_t *split_blk, | |
64 | xfs_da_state_blk_t *blk_to_add, | |
65 | int treelevel, | |
66 | int *result); | |
f5ea1100 | 67 | STATIC void xfs_da3_node_rebalance(xfs_da_state_t *state, |
1da177e4 LT |
68 | xfs_da_state_blk_t *node_blk_1, |
69 | xfs_da_state_blk_t *node_blk_2); | |
f5ea1100 | 70 | STATIC void xfs_da3_node_add(xfs_da_state_t *state, |
1da177e4 LT |
71 | xfs_da_state_blk_t *old_node_blk, |
72 | xfs_da_state_blk_t *new_node_blk); | |
73 | ||
74 | /* | |
75 | * Routines used for shrinking the Btree. | |
76 | */ | |
f5ea1100 | 77 | STATIC int xfs_da3_root_join(xfs_da_state_t *state, |
1da177e4 | 78 | xfs_da_state_blk_t *root_blk); |
f5ea1100 DC |
79 | STATIC int xfs_da3_node_toosmall(xfs_da_state_t *state, int *retval); |
80 | STATIC void xfs_da3_node_remove(xfs_da_state_t *state, | |
1da177e4 | 81 | xfs_da_state_blk_t *drop_blk); |
f5ea1100 | 82 | STATIC void xfs_da3_node_unbalance(xfs_da_state_t *state, |
1da177e4 LT |
83 | xfs_da_state_blk_t *src_node_blk, |
84 | xfs_da_state_blk_t *dst_node_blk); | |
85 | ||
86 | /* | |
87 | * Utility routines. | |
88 | */ | |
f5ea1100 | 89 | STATIC int xfs_da3_blk_unlink(xfs_da_state_t *state, |
ba0f32d4 CH |
90 | xfs_da_state_blk_t *drop_blk, |
91 | xfs_da_state_blk_t *save_blk); | |
1da177e4 | 92 | |
f5ea1100 DC |
93 | |
94 | kmem_zone_t *xfs_da_state_zone; /* anchor for state struct zone */ | |
95 | ||
96 | /* | |
97 | * Allocate a dir-state structure. | |
98 | * We don't put them on the stack since they're large. | |
99 | */ | |
100 | xfs_da_state_t * | |
101 | xfs_da_state_alloc(void) | |
102 | { | |
103 | return kmem_zone_zalloc(xfs_da_state_zone, KM_NOFS); | |
104 | } | |
105 | ||
106 | /* | |
107 | * Kill the altpath contents of a da-state structure. | |
108 | */ | |
109 | STATIC void | |
110 | xfs_da_state_kill_altpath(xfs_da_state_t *state) | |
111 | { | |
112 | int i; | |
113 | ||
114 | for (i = 0; i < state->altpath.active; i++) | |
115 | state->altpath.blk[i].bp = NULL; | |
116 | state->altpath.active = 0; | |
117 | } | |
118 | ||
119 | /* | |
120 | * Free a da-state structure. | |
121 | */ | |
122 | void | |
123 | xfs_da_state_free(xfs_da_state_t *state) | |
124 | { | |
125 | xfs_da_state_kill_altpath(state); | |
126 | #ifdef DEBUG | |
127 | memset((char *)state, 0, sizeof(*state)); | |
128 | #endif /* DEBUG */ | |
129 | kmem_zone_free(xfs_da_state_zone, state); | |
130 | } | |
131 | ||
f5ea1100 DC |
132 | static bool |
133 | xfs_da3_node_verify( | |
d9392a4b DC |
134 | struct xfs_buf *bp) |
135 | { | |
136 | struct xfs_mount *mp = bp->b_target->bt_mount; | |
f5ea1100 DC |
137 | struct xfs_da_intnode *hdr = bp->b_addr; |
138 | struct xfs_da3_icnode_hdr ichdr; | |
01ba43b8 DC |
139 | const struct xfs_dir_ops *ops; |
140 | ||
141 | ops = xfs_dir_get_ops(mp, NULL); | |
f5ea1100 | 142 | |
01ba43b8 | 143 | ops->node_hdr_from_disk(&ichdr, hdr); |
f5ea1100 DC |
144 | |
145 | if (xfs_sb_version_hascrc(&mp->m_sb)) { | |
146 | struct xfs_da3_node_hdr *hdr3 = bp->b_addr; | |
147 | ||
148 | if (ichdr.magic != XFS_DA3_NODE_MAGIC) | |
149 | return false; | |
150 | ||
151 | if (!uuid_equal(&hdr3->info.uuid, &mp->m_sb.sb_uuid)) | |
152 | return false; | |
153 | if (be64_to_cpu(hdr3->info.blkno) != bp->b_bn) | |
154 | return false; | |
155 | } else { | |
156 | if (ichdr.magic != XFS_DA_NODE_MAGIC) | |
157 | return false; | |
d9392a4b | 158 | } |
f5ea1100 DC |
159 | if (ichdr.level == 0) |
160 | return false; | |
161 | if (ichdr.level > XFS_DA_NODE_MAXDEPTH) | |
162 | return false; | |
163 | if (ichdr.count == 0) | |
164 | return false; | |
165 | ||
166 | /* | |
167 | * we don't know if the node is for and attribute or directory tree, | |
168 | * so only fail if the count is outside both bounds | |
169 | */ | |
170 | if (ichdr.count > mp->m_dir_node_ents && | |
171 | ichdr.count > mp->m_attr_node_ents) | |
172 | return false; | |
173 | ||
174 | /* XXX: hash order check? */ | |
d9392a4b | 175 | |
f5ea1100 | 176 | return true; |
d9392a4b DC |
177 | } |
178 | ||
179 | static void | |
f5ea1100 | 180 | xfs_da3_node_write_verify( |
612cfbfe DC |
181 | struct xfs_buf *bp) |
182 | { | |
f5ea1100 DC |
183 | struct xfs_mount *mp = bp->b_target->bt_mount; |
184 | struct xfs_buf_log_item *bip = bp->b_fspriv; | |
185 | struct xfs_da3_node_hdr *hdr3 = bp->b_addr; | |
186 | ||
187 | if (!xfs_da3_node_verify(bp)) { | |
f5ea1100 | 188 | xfs_buf_ioerror(bp, EFSCORRUPTED); |
ce5028cf | 189 | xfs_verifier_error(bp); |
f5ea1100 DC |
190 | return; |
191 | } | |
192 | ||
193 | if (!xfs_sb_version_hascrc(&mp->m_sb)) | |
194 | return; | |
195 | ||
196 | if (bip) | |
197 | hdr3->info.lsn = cpu_to_be64(bip->bli_item.li_lsn); | |
198 | ||
f1dbcd7e | 199 | xfs_buf_update_cksum(bp, XFS_DA3_NODE_CRC_OFF); |
612cfbfe DC |
200 | } |
201 | ||
1813dd64 DC |
202 | /* |
203 | * leaf/node format detection on trees is sketchy, so a node read can be done on | |
204 | * leaf level blocks when detection identifies the tree as a node format tree | |
205 | * incorrectly. In this case, we need to swap the verifier to match the correct | |
206 | * format of the block being read. | |
207 | */ | |
612cfbfe | 208 | static void |
f5ea1100 | 209 | xfs_da3_node_read_verify( |
d9392a4b DC |
210 | struct xfs_buf *bp) |
211 | { | |
d9392a4b DC |
212 | struct xfs_da_blkinfo *info = bp->b_addr; |
213 | ||
214 | switch (be16_to_cpu(info->magic)) { | |
f5ea1100 | 215 | case XFS_DA3_NODE_MAGIC: |
ce5028cf ES |
216 | if (!xfs_buf_verify_cksum(bp, XFS_DA3_NODE_CRC_OFF)) { |
217 | xfs_buf_ioerror(bp, EFSBADCRC); | |
f5ea1100 | 218 | break; |
ce5028cf | 219 | } |
f5ea1100 | 220 | /* fall through */ |
d9392a4b | 221 | case XFS_DA_NODE_MAGIC: |
ce5028cf ES |
222 | if (!xfs_da3_node_verify(bp)) { |
223 | xfs_buf_ioerror(bp, EFSCORRUPTED); | |
f5ea1100 | 224 | break; |
ce5028cf | 225 | } |
f5ea1100 | 226 | return; |
d9392a4b | 227 | case XFS_ATTR_LEAF_MAGIC: |
7ced60ca | 228 | case XFS_ATTR3_LEAF_MAGIC: |
517c2220 | 229 | bp->b_ops = &xfs_attr3_leaf_buf_ops; |
1813dd64 | 230 | bp->b_ops->verify_read(bp); |
d9392a4b DC |
231 | return; |
232 | case XFS_DIR2_LEAFN_MAGIC: | |
24df33b4 DC |
233 | case XFS_DIR3_LEAFN_MAGIC: |
234 | bp->b_ops = &xfs_dir3_leafn_buf_ops; | |
1813dd64 | 235 | bp->b_ops->verify_read(bp); |
d9392a4b DC |
236 | return; |
237 | default: | |
238 | break; | |
239 | } | |
f5ea1100 DC |
240 | |
241 | /* corrupt block */ | |
ce5028cf | 242 | xfs_verifier_error(bp); |
d9392a4b DC |
243 | } |
244 | ||
f5ea1100 DC |
245 | const struct xfs_buf_ops xfs_da3_node_buf_ops = { |
246 | .verify_read = xfs_da3_node_read_verify, | |
247 | .verify_write = xfs_da3_node_write_verify, | |
1813dd64 DC |
248 | }; |
249 | ||
d9392a4b | 250 | int |
f5ea1100 | 251 | xfs_da3_node_read( |
d9392a4b DC |
252 | struct xfs_trans *tp, |
253 | struct xfs_inode *dp, | |
254 | xfs_dablk_t bno, | |
255 | xfs_daddr_t mappedbno, | |
256 | struct xfs_buf **bpp, | |
257 | int which_fork) | |
258 | { | |
d75afeb3 DC |
259 | int err; |
260 | ||
261 | err = xfs_da_read_buf(tp, dp, bno, mappedbno, bpp, | |
f5ea1100 | 262 | which_fork, &xfs_da3_node_buf_ops); |
d75afeb3 DC |
263 | if (!err && tp) { |
264 | struct xfs_da_blkinfo *info = (*bpp)->b_addr; | |
265 | int type; | |
266 | ||
267 | switch (be16_to_cpu(info->magic)) { | |
d75afeb3 | 268 | case XFS_DA_NODE_MAGIC: |
cab09a81 | 269 | case XFS_DA3_NODE_MAGIC: |
61fe135c | 270 | type = XFS_BLFT_DA_NODE_BUF; |
d75afeb3 DC |
271 | break; |
272 | case XFS_ATTR_LEAF_MAGIC: | |
273 | case XFS_ATTR3_LEAF_MAGIC: | |
61fe135c | 274 | type = XFS_BLFT_ATTR_LEAF_BUF; |
d75afeb3 DC |
275 | break; |
276 | case XFS_DIR2_LEAFN_MAGIC: | |
277 | case XFS_DIR3_LEAFN_MAGIC: | |
61fe135c | 278 | type = XFS_BLFT_DIR_LEAFN_BUF; |
d75afeb3 DC |
279 | break; |
280 | default: | |
281 | type = 0; | |
282 | ASSERT(0); | |
283 | break; | |
284 | } | |
285 | xfs_trans_buf_set_type(tp, *bpp, type); | |
286 | } | |
287 | return err; | |
d9392a4b DC |
288 | } |
289 | ||
1da177e4 LT |
290 | /*======================================================================== |
291 | * Routines used for growing the Btree. | |
292 | *========================================================================*/ | |
293 | ||
294 | /* | |
295 | * Create the initial contents of an intermediate node. | |
296 | */ | |
297 | int | |
f5ea1100 DC |
298 | xfs_da3_node_create( |
299 | struct xfs_da_args *args, | |
300 | xfs_dablk_t blkno, | |
301 | int level, | |
302 | struct xfs_buf **bpp, | |
303 | int whichfork) | |
1da177e4 | 304 | { |
f5ea1100 DC |
305 | struct xfs_da_intnode *node; |
306 | struct xfs_trans *tp = args->trans; | |
307 | struct xfs_mount *mp = tp->t_mountp; | |
308 | struct xfs_da3_icnode_hdr ichdr = {0}; | |
309 | struct xfs_buf *bp; | |
310 | int error; | |
01ba43b8 | 311 | struct xfs_inode *dp = args->dp; |
1da177e4 | 312 | |
5a5881cd | 313 | trace_xfs_da_node_create(args); |
f5ea1100 | 314 | ASSERT(level <= XFS_DA_NODE_MAXDEPTH); |
5a5881cd | 315 | |
01ba43b8 | 316 | error = xfs_da_get_buf(tp, dp, blkno, -1, &bp, whichfork); |
1da177e4 LT |
317 | if (error) |
318 | return(error); | |
d75afeb3 | 319 | bp->b_ops = &xfs_da3_node_buf_ops; |
61fe135c | 320 | xfs_trans_buf_set_type(tp, bp, XFS_BLFT_DA_NODE_BUF); |
1d9025e5 | 321 | node = bp->b_addr; |
1da177e4 | 322 | |
f5ea1100 DC |
323 | if (xfs_sb_version_hascrc(&mp->m_sb)) { |
324 | struct xfs_da3_node_hdr *hdr3 = bp->b_addr; | |
325 | ||
326 | ichdr.magic = XFS_DA3_NODE_MAGIC; | |
327 | hdr3->info.blkno = cpu_to_be64(bp->b_bn); | |
328 | hdr3->info.owner = cpu_to_be64(args->dp->i_ino); | |
329 | uuid_copy(&hdr3->info.uuid, &mp->m_sb.sb_uuid); | |
330 | } else { | |
331 | ichdr.magic = XFS_DA_NODE_MAGIC; | |
332 | } | |
333 | ichdr.level = level; | |
334 | ||
01ba43b8 | 335 | dp->d_ops->node_hdr_to_disk(node, &ichdr); |
1d9025e5 | 336 | xfs_trans_log_buf(tp, bp, |
1c9a5b2e | 337 | XFS_DA_LOGRANGE(node, &node->hdr, dp->d_ops->node_hdr_size)); |
1da177e4 LT |
338 | |
339 | *bpp = bp; | |
340 | return(0); | |
341 | } | |
342 | ||
343 | /* | |
344 | * Split a leaf node, rebalance, then possibly split | |
345 | * intermediate nodes, rebalance, etc. | |
346 | */ | |
347 | int /* error */ | |
f5ea1100 DC |
348 | xfs_da3_split( |
349 | struct xfs_da_state *state) | |
1da177e4 | 350 | { |
f5ea1100 DC |
351 | struct xfs_da_state_blk *oldblk; |
352 | struct xfs_da_state_blk *newblk; | |
353 | struct xfs_da_state_blk *addblk; | |
354 | struct xfs_da_intnode *node; | |
355 | struct xfs_buf *bp; | |
356 | int max; | |
836a94ad | 357 | int action = 0; |
f5ea1100 DC |
358 | int error; |
359 | int i; | |
1da177e4 | 360 | |
5a5881cd DC |
361 | trace_xfs_da_split(state->args); |
362 | ||
1da177e4 LT |
363 | /* |
364 | * Walk back up the tree splitting/inserting/adjusting as necessary. | |
365 | * If we need to insert and there isn't room, split the node, then | |
366 | * decide which fragment to insert the new block from below into. | |
367 | * Note that we may split the root this way, but we need more fixup. | |
368 | */ | |
369 | max = state->path.active - 1; | |
370 | ASSERT((max >= 0) && (max < XFS_DA_NODE_MAXDEPTH)); | |
371 | ASSERT(state->path.blk[max].magic == XFS_ATTR_LEAF_MAGIC || | |
f6c2d1fa | 372 | state->path.blk[max].magic == XFS_DIR2_LEAFN_MAGIC); |
1da177e4 LT |
373 | |
374 | addblk = &state->path.blk[max]; /* initial dummy value */ | |
375 | for (i = max; (i >= 0) && addblk; state->path.active--, i--) { | |
376 | oldblk = &state->path.blk[i]; | |
377 | newblk = &state->altpath.blk[i]; | |
378 | ||
379 | /* | |
380 | * If a leaf node then | |
381 | * Allocate a new leaf node, then rebalance across them. | |
382 | * else if an intermediate node then | |
383 | * We split on the last layer, must we split the node? | |
384 | */ | |
385 | switch (oldblk->magic) { | |
386 | case XFS_ATTR_LEAF_MAGIC: | |
517c2220 | 387 | error = xfs_attr3_leaf_split(state, oldblk, newblk); |
1da177e4 LT |
388 | if ((error != 0) && (error != ENOSPC)) { |
389 | return(error); /* GROT: attr is inconsistent */ | |
390 | } | |
391 | if (!error) { | |
392 | addblk = newblk; | |
393 | break; | |
394 | } | |
395 | /* | |
396 | * Entry wouldn't fit, split the leaf again. | |
397 | */ | |
398 | state->extravalid = 1; | |
399 | if (state->inleaf) { | |
400 | state->extraafter = 0; /* before newblk */ | |
5a5881cd | 401 | trace_xfs_attr_leaf_split_before(state->args); |
517c2220 | 402 | error = xfs_attr3_leaf_split(state, oldblk, |
1da177e4 LT |
403 | &state->extrablk); |
404 | } else { | |
405 | state->extraafter = 1; /* after newblk */ | |
5a5881cd | 406 | trace_xfs_attr_leaf_split_after(state->args); |
517c2220 | 407 | error = xfs_attr3_leaf_split(state, newblk, |
1da177e4 LT |
408 | &state->extrablk); |
409 | } | |
410 | if (error) | |
411 | return(error); /* GROT: attr inconsistent */ | |
412 | addblk = newblk; | |
413 | break; | |
1da177e4 | 414 | case XFS_DIR2_LEAFN_MAGIC: |
1da177e4 LT |
415 | error = xfs_dir2_leafn_split(state, oldblk, newblk); |
416 | if (error) | |
417 | return error; | |
418 | addblk = newblk; | |
419 | break; | |
420 | case XFS_DA_NODE_MAGIC: | |
f5ea1100 | 421 | error = xfs_da3_node_split(state, oldblk, newblk, addblk, |
1da177e4 | 422 | max - i, &action); |
1da177e4 LT |
423 | addblk->bp = NULL; |
424 | if (error) | |
425 | return(error); /* GROT: dir is inconsistent */ | |
426 | /* | |
427 | * Record the newly split block for the next time thru? | |
428 | */ | |
429 | if (action) | |
430 | addblk = newblk; | |
431 | else | |
432 | addblk = NULL; | |
433 | break; | |
434 | } | |
435 | ||
436 | /* | |
437 | * Update the btree to show the new hashval for this child. | |
438 | */ | |
f5ea1100 | 439 | xfs_da3_fixhashpath(state, &state->path); |
1da177e4 LT |
440 | } |
441 | if (!addblk) | |
442 | return(0); | |
443 | ||
444 | /* | |
445 | * Split the root node. | |
446 | */ | |
447 | ASSERT(state->path.active == 0); | |
448 | oldblk = &state->path.blk[0]; | |
f5ea1100 | 449 | error = xfs_da3_root_split(state, oldblk, addblk); |
1da177e4 | 450 | if (error) { |
1da177e4 LT |
451 | addblk->bp = NULL; |
452 | return(error); /* GROT: dir is inconsistent */ | |
453 | } | |
454 | ||
455 | /* | |
456 | * Update pointers to the node which used to be block 0 and | |
457 | * just got bumped because of the addition of a new root node. | |
458 | * There might be three blocks involved if a double split occurred, | |
459 | * and the original block 0 could be at any position in the list. | |
f5ea1100 DC |
460 | * |
461 | * Note: the magic numbers and sibling pointers are in the same | |
462 | * physical place for both v2 and v3 headers (by design). Hence it | |
463 | * doesn't matter which version of the xfs_da_intnode structure we use | |
464 | * here as the result will be the same using either structure. | |
1da177e4 | 465 | */ |
1d9025e5 | 466 | node = oldblk->bp->b_addr; |
1da177e4 | 467 | if (node->hdr.info.forw) { |
89da0544 | 468 | if (be32_to_cpu(node->hdr.info.forw) == addblk->blkno) { |
1da177e4 LT |
469 | bp = addblk->bp; |
470 | } else { | |
471 | ASSERT(state->extravalid); | |
472 | bp = state->extrablk.bp; | |
473 | } | |
1d9025e5 | 474 | node = bp->b_addr; |
89da0544 | 475 | node->hdr.info.back = cpu_to_be32(oldblk->blkno); |
1d9025e5 | 476 | xfs_trans_log_buf(state->args->trans, bp, |
1da177e4 LT |
477 | XFS_DA_LOGRANGE(node, &node->hdr.info, |
478 | sizeof(node->hdr.info))); | |
479 | } | |
1d9025e5 | 480 | node = oldblk->bp->b_addr; |
89da0544 NS |
481 | if (node->hdr.info.back) { |
482 | if (be32_to_cpu(node->hdr.info.back) == addblk->blkno) { | |
1da177e4 LT |
483 | bp = addblk->bp; |
484 | } else { | |
485 | ASSERT(state->extravalid); | |
486 | bp = state->extrablk.bp; | |
487 | } | |
1d9025e5 | 488 | node = bp->b_addr; |
89da0544 | 489 | node->hdr.info.forw = cpu_to_be32(oldblk->blkno); |
1d9025e5 | 490 | xfs_trans_log_buf(state->args->trans, bp, |
1da177e4 LT |
491 | XFS_DA_LOGRANGE(node, &node->hdr.info, |
492 | sizeof(node->hdr.info))); | |
493 | } | |
1da177e4 LT |
494 | addblk->bp = NULL; |
495 | return(0); | |
496 | } | |
497 | ||
498 | /* | |
499 | * Split the root. We have to create a new root and point to the two | |
500 | * parts (the split old root) that we just created. Copy block zero to | |
501 | * the EOF, extending the inode in process. | |
502 | */ | |
503 | STATIC int /* error */ | |
f5ea1100 DC |
504 | xfs_da3_root_split( |
505 | struct xfs_da_state *state, | |
506 | struct xfs_da_state_blk *blk1, | |
507 | struct xfs_da_state_blk *blk2) | |
1da177e4 | 508 | { |
f5ea1100 DC |
509 | struct xfs_da_intnode *node; |
510 | struct xfs_da_intnode *oldroot; | |
511 | struct xfs_da_node_entry *btree; | |
512 | struct xfs_da3_icnode_hdr nodehdr; | |
513 | struct xfs_da_args *args; | |
514 | struct xfs_buf *bp; | |
515 | struct xfs_inode *dp; | |
516 | struct xfs_trans *tp; | |
517 | struct xfs_mount *mp; | |
518 | struct xfs_dir2_leaf *leaf; | |
519 | xfs_dablk_t blkno; | |
520 | int level; | |
521 | int error; | |
522 | int size; | |
1da177e4 | 523 | |
5a5881cd DC |
524 | trace_xfs_da_root_split(state->args); |
525 | ||
1da177e4 LT |
526 | /* |
527 | * Copy the existing (incorrect) block from the root node position | |
528 | * to a free space somewhere. | |
529 | */ | |
530 | args = state->args; | |
1da177e4 LT |
531 | error = xfs_da_grow_inode(args, &blkno); |
532 | if (error) | |
f5ea1100 DC |
533 | return error; |
534 | ||
1da177e4 LT |
535 | dp = args->dp; |
536 | tp = args->trans; | |
537 | mp = state->mp; | |
538 | error = xfs_da_get_buf(tp, dp, blkno, -1, &bp, args->whichfork); | |
539 | if (error) | |
f5ea1100 | 540 | return error; |
1d9025e5 DC |
541 | node = bp->b_addr; |
542 | oldroot = blk1->bp->b_addr; | |
f5ea1100 DC |
543 | if (oldroot->hdr.info.magic == cpu_to_be16(XFS_DA_NODE_MAGIC) || |
544 | oldroot->hdr.info.magic == cpu_to_be16(XFS_DA3_NODE_MAGIC)) { | |
545 | struct xfs_da3_icnode_hdr nodehdr; | |
546 | ||
01ba43b8 | 547 | dp->d_ops->node_hdr_from_disk(&nodehdr, oldroot); |
4bceb18f | 548 | btree = dp->d_ops->node_tree_p(oldroot); |
f5ea1100 DC |
549 | size = (int)((char *)&btree[nodehdr.count] - (char *)oldroot); |
550 | level = nodehdr.level; | |
d75afeb3 DC |
551 | |
552 | /* | |
553 | * we are about to copy oldroot to bp, so set up the type | |
554 | * of bp while we know exactly what it will be. | |
555 | */ | |
61fe135c | 556 | xfs_trans_buf_set_type(tp, bp, XFS_BLFT_DA_NODE_BUF); |
1da177e4 | 557 | } else { |
24df33b4 DC |
558 | struct xfs_dir3_icleaf_hdr leafhdr; |
559 | struct xfs_dir2_leaf_entry *ents; | |
560 | ||
1da177e4 | 561 | leaf = (xfs_dir2_leaf_t *)oldroot; |
01ba43b8 | 562 | dp->d_ops->leaf_hdr_from_disk(&leafhdr, leaf); |
4141956a | 563 | ents = dp->d_ops->leaf_ents_p(leaf); |
24df33b4 DC |
564 | |
565 | ASSERT(leafhdr.magic == XFS_DIR2_LEAFN_MAGIC || | |
566 | leafhdr.magic == XFS_DIR3_LEAFN_MAGIC); | |
567 | size = (int)((char *)&ents[leafhdr.count] - (char *)leaf); | |
f5ea1100 | 568 | level = 0; |
d75afeb3 DC |
569 | |
570 | /* | |
571 | * we are about to copy oldroot to bp, so set up the type | |
572 | * of bp while we know exactly what it will be. | |
573 | */ | |
61fe135c | 574 | xfs_trans_buf_set_type(tp, bp, XFS_BLFT_DIR_LEAFN_BUF); |
1da177e4 | 575 | } |
f5ea1100 DC |
576 | |
577 | /* | |
578 | * we can copy most of the information in the node from one block to | |
579 | * another, but for CRC enabled headers we have to make sure that the | |
580 | * block specific identifiers are kept intact. We update the buffer | |
581 | * directly for this. | |
582 | */ | |
1da177e4 | 583 | memcpy(node, oldroot, size); |
f5ea1100 DC |
584 | if (oldroot->hdr.info.magic == cpu_to_be16(XFS_DA3_NODE_MAGIC) || |
585 | oldroot->hdr.info.magic == cpu_to_be16(XFS_DIR3_LEAFN_MAGIC)) { | |
586 | struct xfs_da3_intnode *node3 = (struct xfs_da3_intnode *)node; | |
587 | ||
588 | node3->hdr.info.blkno = cpu_to_be64(bp->b_bn); | |
589 | } | |
1d9025e5 | 590 | xfs_trans_log_buf(tp, bp, 0, size - 1); |
b0f539de | 591 | |
1813dd64 | 592 | bp->b_ops = blk1->bp->b_ops; |
0a4edc8f | 593 | xfs_trans_buf_copy_type(bp, blk1->bp); |
1da177e4 LT |
594 | blk1->bp = bp; |
595 | blk1->blkno = blkno; | |
596 | ||
597 | /* | |
598 | * Set up the new root node. | |
599 | */ | |
f5ea1100 | 600 | error = xfs_da3_node_create(args, |
7dda6e86 | 601 | (args->whichfork == XFS_DATA_FORK) ? args->geo->leafblk : 0, |
f5ea1100 | 602 | level + 1, &bp, args->whichfork); |
1da177e4 | 603 | if (error) |
f5ea1100 DC |
604 | return error; |
605 | ||
1d9025e5 | 606 | node = bp->b_addr; |
01ba43b8 | 607 | dp->d_ops->node_hdr_from_disk(&nodehdr, node); |
4bceb18f | 608 | btree = dp->d_ops->node_tree_p(node); |
f5ea1100 DC |
609 | btree[0].hashval = cpu_to_be32(blk1->hashval); |
610 | btree[0].before = cpu_to_be32(blk1->blkno); | |
611 | btree[1].hashval = cpu_to_be32(blk2->hashval); | |
612 | btree[1].before = cpu_to_be32(blk2->blkno); | |
613 | nodehdr.count = 2; | |
01ba43b8 | 614 | dp->d_ops->node_hdr_to_disk(node, &nodehdr); |
1da177e4 LT |
615 | |
616 | #ifdef DEBUG | |
24df33b4 DC |
617 | if (oldroot->hdr.info.magic == cpu_to_be16(XFS_DIR2_LEAFN_MAGIC) || |
618 | oldroot->hdr.info.magic == cpu_to_be16(XFS_DIR3_LEAFN_MAGIC)) { | |
7dda6e86 DC |
619 | ASSERT(blk1->blkno >= args->geo->leafblk && |
620 | blk1->blkno < args->geo->freeblk); | |
621 | ASSERT(blk2->blkno >= args->geo->leafblk && | |
622 | blk2->blkno < args->geo->freeblk); | |
1da177e4 LT |
623 | } |
624 | #endif | |
625 | ||
626 | /* Header is already logged by xfs_da_node_create */ | |
1d9025e5 | 627 | xfs_trans_log_buf(tp, bp, |
f5ea1100 | 628 | XFS_DA_LOGRANGE(node, btree, sizeof(xfs_da_node_entry_t) * 2)); |
1da177e4 | 629 | |
f5ea1100 | 630 | return 0; |
1da177e4 LT |
631 | } |
632 | ||
633 | /* | |
634 | * Split the node, rebalance, then add the new entry. | |
635 | */ | |
636 | STATIC int /* error */ | |
f5ea1100 DC |
637 | xfs_da3_node_split( |
638 | struct xfs_da_state *state, | |
639 | struct xfs_da_state_blk *oldblk, | |
640 | struct xfs_da_state_blk *newblk, | |
641 | struct xfs_da_state_blk *addblk, | |
642 | int treelevel, | |
643 | int *result) | |
1da177e4 | 644 | { |
f5ea1100 DC |
645 | struct xfs_da_intnode *node; |
646 | struct xfs_da3_icnode_hdr nodehdr; | |
647 | xfs_dablk_t blkno; | |
648 | int newcount; | |
649 | int error; | |
650 | int useextra; | |
01ba43b8 | 651 | struct xfs_inode *dp = state->args->dp; |
1da177e4 | 652 | |
5a5881cd DC |
653 | trace_xfs_da_node_split(state->args); |
654 | ||
1d9025e5 | 655 | node = oldblk->bp->b_addr; |
01ba43b8 | 656 | dp->d_ops->node_hdr_from_disk(&nodehdr, node); |
1da177e4 LT |
657 | |
658 | /* | |
f6c2d1fa | 659 | * With V2 dirs the extra block is data or freespace. |
1da177e4 | 660 | */ |
f6c2d1fa | 661 | useextra = state->extravalid && state->args->whichfork == XFS_ATTR_FORK; |
1da177e4 LT |
662 | newcount = 1 + useextra; |
663 | /* | |
664 | * Do we have to split the node? | |
665 | */ | |
f5ea1100 | 666 | if (nodehdr.count + newcount > state->node_ents) { |
1da177e4 LT |
667 | /* |
668 | * Allocate a new node, add to the doubly linked chain of | |
669 | * nodes, then move some of our excess entries into it. | |
670 | */ | |
671 | error = xfs_da_grow_inode(state->args, &blkno); | |
672 | if (error) | |
673 | return(error); /* GROT: dir is inconsistent */ | |
674 | ||
f5ea1100 | 675 | error = xfs_da3_node_create(state->args, blkno, treelevel, |
1da177e4 LT |
676 | &newblk->bp, state->args->whichfork); |
677 | if (error) | |
678 | return(error); /* GROT: dir is inconsistent */ | |
679 | newblk->blkno = blkno; | |
680 | newblk->magic = XFS_DA_NODE_MAGIC; | |
f5ea1100 DC |
681 | xfs_da3_node_rebalance(state, oldblk, newblk); |
682 | error = xfs_da3_blk_link(state, oldblk, newblk); | |
1da177e4 LT |
683 | if (error) |
684 | return(error); | |
685 | *result = 1; | |
686 | } else { | |
687 | *result = 0; | |
688 | } | |
689 | ||
690 | /* | |
691 | * Insert the new entry(s) into the correct block | |
692 | * (updating last hashval in the process). | |
693 | * | |
f5ea1100 | 694 | * xfs_da3_node_add() inserts BEFORE the given index, |
1da177e4 LT |
695 | * and as a result of using node_lookup_int() we always |
696 | * point to a valid entry (not after one), but a split | |
697 | * operation always results in a new block whose hashvals | |
698 | * FOLLOW the current block. | |
699 | * | |
700 | * If we had double-split op below us, then add the extra block too. | |
701 | */ | |
1d9025e5 | 702 | node = oldblk->bp->b_addr; |
01ba43b8 | 703 | dp->d_ops->node_hdr_from_disk(&nodehdr, node); |
f5ea1100 | 704 | if (oldblk->index <= nodehdr.count) { |
1da177e4 | 705 | oldblk->index++; |
f5ea1100 | 706 | xfs_da3_node_add(state, oldblk, addblk); |
1da177e4 LT |
707 | if (useextra) { |
708 | if (state->extraafter) | |
709 | oldblk->index++; | |
f5ea1100 | 710 | xfs_da3_node_add(state, oldblk, &state->extrablk); |
1da177e4 LT |
711 | state->extravalid = 0; |
712 | } | |
713 | } else { | |
714 | newblk->index++; | |
f5ea1100 | 715 | xfs_da3_node_add(state, newblk, addblk); |
1da177e4 LT |
716 | if (useextra) { |
717 | if (state->extraafter) | |
718 | newblk->index++; | |
f5ea1100 | 719 | xfs_da3_node_add(state, newblk, &state->extrablk); |
1da177e4 LT |
720 | state->extravalid = 0; |
721 | } | |
722 | } | |
723 | ||
724 | return(0); | |
725 | } | |
726 | ||
727 | /* | |
728 | * Balance the btree elements between two intermediate nodes, | |
729 | * usually one full and one empty. | |
730 | * | |
731 | * NOTE: if blk2 is empty, then it will get the upper half of blk1. | |
732 | */ | |
733 | STATIC void | |
f5ea1100 DC |
734 | xfs_da3_node_rebalance( |
735 | struct xfs_da_state *state, | |
736 | struct xfs_da_state_blk *blk1, | |
737 | struct xfs_da_state_blk *blk2) | |
1da177e4 | 738 | { |
f5ea1100 DC |
739 | struct xfs_da_intnode *node1; |
740 | struct xfs_da_intnode *node2; | |
741 | struct xfs_da_intnode *tmpnode; | |
742 | struct xfs_da_node_entry *btree1; | |
743 | struct xfs_da_node_entry *btree2; | |
744 | struct xfs_da_node_entry *btree_s; | |
745 | struct xfs_da_node_entry *btree_d; | |
746 | struct xfs_da3_icnode_hdr nodehdr1; | |
747 | struct xfs_da3_icnode_hdr nodehdr2; | |
748 | struct xfs_trans *tp; | |
749 | int count; | |
750 | int tmp; | |
751 | int swap = 0; | |
4bceb18f | 752 | struct xfs_inode *dp = state->args->dp; |
1da177e4 | 753 | |
5a5881cd DC |
754 | trace_xfs_da_node_rebalance(state->args); |
755 | ||
1d9025e5 DC |
756 | node1 = blk1->bp->b_addr; |
757 | node2 = blk2->bp->b_addr; | |
01ba43b8 DC |
758 | dp->d_ops->node_hdr_from_disk(&nodehdr1, node1); |
759 | dp->d_ops->node_hdr_from_disk(&nodehdr2, node2); | |
4bceb18f DC |
760 | btree1 = dp->d_ops->node_tree_p(node1); |
761 | btree2 = dp->d_ops->node_tree_p(node2); | |
f5ea1100 | 762 | |
1da177e4 LT |
763 | /* |
764 | * Figure out how many entries need to move, and in which direction. | |
765 | * Swap the nodes around if that makes it simpler. | |
766 | */ | |
f5ea1100 DC |
767 | if (nodehdr1.count > 0 && nodehdr2.count > 0 && |
768 | ((be32_to_cpu(btree2[0].hashval) < be32_to_cpu(btree1[0].hashval)) || | |
769 | (be32_to_cpu(btree2[nodehdr2.count - 1].hashval) < | |
770 | be32_to_cpu(btree1[nodehdr1.count - 1].hashval)))) { | |
1da177e4 LT |
771 | tmpnode = node1; |
772 | node1 = node2; | |
773 | node2 = tmpnode; | |
01ba43b8 DC |
774 | dp->d_ops->node_hdr_from_disk(&nodehdr1, node1); |
775 | dp->d_ops->node_hdr_from_disk(&nodehdr2, node2); | |
4bceb18f DC |
776 | btree1 = dp->d_ops->node_tree_p(node1); |
777 | btree2 = dp->d_ops->node_tree_p(node2); | |
f5ea1100 | 778 | swap = 1; |
1da177e4 | 779 | } |
f5ea1100 DC |
780 | |
781 | count = (nodehdr1.count - nodehdr2.count) / 2; | |
1da177e4 LT |
782 | if (count == 0) |
783 | return; | |
784 | tp = state->args->trans; | |
785 | /* | |
786 | * Two cases: high-to-low and low-to-high. | |
787 | */ | |
788 | if (count > 0) { | |
789 | /* | |
790 | * Move elements in node2 up to make a hole. | |
791 | */ | |
f5ea1100 DC |
792 | tmp = nodehdr2.count; |
793 | if (tmp > 0) { | |
1da177e4 | 794 | tmp *= (uint)sizeof(xfs_da_node_entry_t); |
f5ea1100 DC |
795 | btree_s = &btree2[0]; |
796 | btree_d = &btree2[count]; | |
1da177e4 LT |
797 | memmove(btree_d, btree_s, tmp); |
798 | } | |
799 | ||
800 | /* | |
801 | * Move the req'd B-tree elements from high in node1 to | |
802 | * low in node2. | |
803 | */ | |
f5ea1100 | 804 | nodehdr2.count += count; |
1da177e4 | 805 | tmp = count * (uint)sizeof(xfs_da_node_entry_t); |
f5ea1100 DC |
806 | btree_s = &btree1[nodehdr1.count - count]; |
807 | btree_d = &btree2[0]; | |
1da177e4 | 808 | memcpy(btree_d, btree_s, tmp); |
f5ea1100 | 809 | nodehdr1.count -= count; |
1da177e4 LT |
810 | } else { |
811 | /* | |
812 | * Move the req'd B-tree elements from low in node2 to | |
813 | * high in node1. | |
814 | */ | |
815 | count = -count; | |
816 | tmp = count * (uint)sizeof(xfs_da_node_entry_t); | |
f5ea1100 DC |
817 | btree_s = &btree2[0]; |
818 | btree_d = &btree1[nodehdr1.count]; | |
1da177e4 | 819 | memcpy(btree_d, btree_s, tmp); |
f5ea1100 DC |
820 | nodehdr1.count += count; |
821 | ||
1d9025e5 | 822 | xfs_trans_log_buf(tp, blk1->bp, |
1da177e4 LT |
823 | XFS_DA_LOGRANGE(node1, btree_d, tmp)); |
824 | ||
825 | /* | |
826 | * Move elements in node2 down to fill the hole. | |
827 | */ | |
f5ea1100 | 828 | tmp = nodehdr2.count - count; |
1da177e4 | 829 | tmp *= (uint)sizeof(xfs_da_node_entry_t); |
f5ea1100 DC |
830 | btree_s = &btree2[count]; |
831 | btree_d = &btree2[0]; | |
1da177e4 | 832 | memmove(btree_d, btree_s, tmp); |
f5ea1100 | 833 | nodehdr2.count -= count; |
1da177e4 LT |
834 | } |
835 | ||
836 | /* | |
837 | * Log header of node 1 and all current bits of node 2. | |
838 | */ | |
01ba43b8 | 839 | dp->d_ops->node_hdr_to_disk(node1, &nodehdr1); |
1d9025e5 | 840 | xfs_trans_log_buf(tp, blk1->bp, |
1c9a5b2e | 841 | XFS_DA_LOGRANGE(node1, &node1->hdr, dp->d_ops->node_hdr_size)); |
f5ea1100 | 842 | |
01ba43b8 | 843 | dp->d_ops->node_hdr_to_disk(node2, &nodehdr2); |
1d9025e5 | 844 | xfs_trans_log_buf(tp, blk2->bp, |
1da177e4 | 845 | XFS_DA_LOGRANGE(node2, &node2->hdr, |
1c9a5b2e | 846 | dp->d_ops->node_hdr_size + |
f5ea1100 | 847 | (sizeof(btree2[0]) * nodehdr2.count))); |
1da177e4 LT |
848 | |
849 | /* | |
850 | * Record the last hashval from each block for upward propagation. | |
851 | * (note: don't use the swapped node pointers) | |
852 | */ | |
f5ea1100 DC |
853 | if (swap) { |
854 | node1 = blk1->bp->b_addr; | |
855 | node2 = blk2->bp->b_addr; | |
01ba43b8 DC |
856 | dp->d_ops->node_hdr_from_disk(&nodehdr1, node1); |
857 | dp->d_ops->node_hdr_from_disk(&nodehdr2, node2); | |
4bceb18f DC |
858 | btree1 = dp->d_ops->node_tree_p(node1); |
859 | btree2 = dp->d_ops->node_tree_p(node2); | |
f5ea1100 DC |
860 | } |
861 | blk1->hashval = be32_to_cpu(btree1[nodehdr1.count - 1].hashval); | |
862 | blk2->hashval = be32_to_cpu(btree2[nodehdr2.count - 1].hashval); | |
1da177e4 LT |
863 | |
864 | /* | |
865 | * Adjust the expected index for insertion. | |
866 | */ | |
f5ea1100 DC |
867 | if (blk1->index >= nodehdr1.count) { |
868 | blk2->index = blk1->index - nodehdr1.count; | |
869 | blk1->index = nodehdr1.count + 1; /* make it invalid */ | |
1da177e4 LT |
870 | } |
871 | } | |
872 | ||
873 | /* | |
874 | * Add a new entry to an intermediate node. | |
875 | */ | |
876 | STATIC void | |
f5ea1100 DC |
877 | xfs_da3_node_add( |
878 | struct xfs_da_state *state, | |
879 | struct xfs_da_state_blk *oldblk, | |
880 | struct xfs_da_state_blk *newblk) | |
1da177e4 | 881 | { |
f5ea1100 DC |
882 | struct xfs_da_intnode *node; |
883 | struct xfs_da3_icnode_hdr nodehdr; | |
884 | struct xfs_da_node_entry *btree; | |
885 | int tmp; | |
4bceb18f | 886 | struct xfs_inode *dp = state->args->dp; |
1da177e4 | 887 | |
5a5881cd DC |
888 | trace_xfs_da_node_add(state->args); |
889 | ||
1d9025e5 | 890 | node = oldblk->bp->b_addr; |
01ba43b8 | 891 | dp->d_ops->node_hdr_from_disk(&nodehdr, node); |
4bceb18f | 892 | btree = dp->d_ops->node_tree_p(node); |
f5ea1100 DC |
893 | |
894 | ASSERT(oldblk->index >= 0 && oldblk->index <= nodehdr.count); | |
1da177e4 | 895 | ASSERT(newblk->blkno != 0); |
f6c2d1fa | 896 | if (state->args->whichfork == XFS_DATA_FORK) |
7dda6e86 DC |
897 | ASSERT(newblk->blkno >= state->args->geo->leafblk && |
898 | newblk->blkno < state->args->geo->freeblk); | |
1da177e4 LT |
899 | |
900 | /* | |
901 | * We may need to make some room before we insert the new node. | |
902 | */ | |
903 | tmp = 0; | |
f5ea1100 DC |
904 | if (oldblk->index < nodehdr.count) { |
905 | tmp = (nodehdr.count - oldblk->index) * (uint)sizeof(*btree); | |
906 | memmove(&btree[oldblk->index + 1], &btree[oldblk->index], tmp); | |
1da177e4 | 907 | } |
f5ea1100 DC |
908 | btree[oldblk->index].hashval = cpu_to_be32(newblk->hashval); |
909 | btree[oldblk->index].before = cpu_to_be32(newblk->blkno); | |
1d9025e5 | 910 | xfs_trans_log_buf(state->args->trans, oldblk->bp, |
f5ea1100 DC |
911 | XFS_DA_LOGRANGE(node, &btree[oldblk->index], |
912 | tmp + sizeof(*btree))); | |
913 | ||
914 | nodehdr.count += 1; | |
01ba43b8 | 915 | dp->d_ops->node_hdr_to_disk(node, &nodehdr); |
1d9025e5 | 916 | xfs_trans_log_buf(state->args->trans, oldblk->bp, |
1c9a5b2e | 917 | XFS_DA_LOGRANGE(node, &node->hdr, dp->d_ops->node_hdr_size)); |
1da177e4 LT |
918 | |
919 | /* | |
920 | * Copy the last hash value from the oldblk to propagate upwards. | |
921 | */ | |
f5ea1100 | 922 | oldblk->hashval = be32_to_cpu(btree[nodehdr.count - 1].hashval); |
1da177e4 LT |
923 | } |
924 | ||
925 | /*======================================================================== | |
926 | * Routines used for shrinking the Btree. | |
927 | *========================================================================*/ | |
928 | ||
929 | /* | |
930 | * Deallocate an empty leaf node, remove it from its parent, | |
931 | * possibly deallocating that block, etc... | |
932 | */ | |
933 | int | |
f5ea1100 DC |
934 | xfs_da3_join( |
935 | struct xfs_da_state *state) | |
1da177e4 | 936 | { |
f5ea1100 DC |
937 | struct xfs_da_state_blk *drop_blk; |
938 | struct xfs_da_state_blk *save_blk; | |
939 | int action = 0; | |
940 | int error; | |
1da177e4 | 941 | |
5a5881cd DC |
942 | trace_xfs_da_join(state->args); |
943 | ||
1da177e4 LT |
944 | drop_blk = &state->path.blk[ state->path.active-1 ]; |
945 | save_blk = &state->altpath.blk[ state->path.active-1 ]; | |
946 | ASSERT(state->path.blk[0].magic == XFS_DA_NODE_MAGIC); | |
947 | ASSERT(drop_blk->magic == XFS_ATTR_LEAF_MAGIC || | |
f6c2d1fa | 948 | drop_blk->magic == XFS_DIR2_LEAFN_MAGIC); |
1da177e4 LT |
949 | |
950 | /* | |
951 | * Walk back up the tree joining/deallocating as necessary. | |
952 | * When we stop dropping blocks, break out. | |
953 | */ | |
954 | for ( ; state->path.active >= 2; drop_blk--, save_blk--, | |
955 | state->path.active--) { | |
956 | /* | |
957 | * See if we can combine the block with a neighbor. | |
958 | * (action == 0) => no options, just leave | |
959 | * (action == 1) => coalesce, then unlink | |
960 | * (action == 2) => block empty, unlink it | |
961 | */ | |
962 | switch (drop_blk->magic) { | |
963 | case XFS_ATTR_LEAF_MAGIC: | |
517c2220 | 964 | error = xfs_attr3_leaf_toosmall(state, &action); |
1da177e4 LT |
965 | if (error) |
966 | return(error); | |
967 | if (action == 0) | |
968 | return(0); | |
517c2220 | 969 | xfs_attr3_leaf_unbalance(state, drop_blk, save_blk); |
1da177e4 | 970 | break; |
1da177e4 | 971 | case XFS_DIR2_LEAFN_MAGIC: |
1da177e4 LT |
972 | error = xfs_dir2_leafn_toosmall(state, &action); |
973 | if (error) | |
974 | return error; | |
975 | if (action == 0) | |
976 | return 0; | |
977 | xfs_dir2_leafn_unbalance(state, drop_blk, save_blk); | |
978 | break; | |
979 | case XFS_DA_NODE_MAGIC: | |
980 | /* | |
981 | * Remove the offending node, fixup hashvals, | |
982 | * check for a toosmall neighbor. | |
983 | */ | |
f5ea1100 DC |
984 | xfs_da3_node_remove(state, drop_blk); |
985 | xfs_da3_fixhashpath(state, &state->path); | |
986 | error = xfs_da3_node_toosmall(state, &action); | |
1da177e4 LT |
987 | if (error) |
988 | return(error); | |
989 | if (action == 0) | |
990 | return 0; | |
f5ea1100 | 991 | xfs_da3_node_unbalance(state, drop_blk, save_blk); |
1da177e4 LT |
992 | break; |
993 | } | |
f5ea1100 DC |
994 | xfs_da3_fixhashpath(state, &state->altpath); |
995 | error = xfs_da3_blk_unlink(state, drop_blk, save_blk); | |
1da177e4 LT |
996 | xfs_da_state_kill_altpath(state); |
997 | if (error) | |
998 | return(error); | |
999 | error = xfs_da_shrink_inode(state->args, drop_blk->blkno, | |
1000 | drop_blk->bp); | |
1001 | drop_blk->bp = NULL; | |
1002 | if (error) | |
1003 | return(error); | |
1004 | } | |
1005 | /* | |
1006 | * We joined all the way to the top. If it turns out that | |
1007 | * we only have one entry in the root, make the child block | |
1008 | * the new root. | |
1009 | */ | |
f5ea1100 DC |
1010 | xfs_da3_node_remove(state, drop_blk); |
1011 | xfs_da3_fixhashpath(state, &state->path); | |
1012 | error = xfs_da3_root_join(state, &state->path.blk[0]); | |
1da177e4 LT |
1013 | return(error); |
1014 | } | |
1015 | ||
1c4f3329 AE |
1016 | #ifdef DEBUG |
1017 | static void | |
1018 | xfs_da_blkinfo_onlychild_validate(struct xfs_da_blkinfo *blkinfo, __u16 level) | |
1019 | { | |
1020 | __be16 magic = blkinfo->magic; | |
1021 | ||
1022 | if (level == 1) { | |
1023 | ASSERT(magic == cpu_to_be16(XFS_DIR2_LEAFN_MAGIC) || | |
24df33b4 | 1024 | magic == cpu_to_be16(XFS_DIR3_LEAFN_MAGIC) || |
517c2220 DC |
1025 | magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC) || |
1026 | magic == cpu_to_be16(XFS_ATTR3_LEAF_MAGIC)); | |
f5ea1100 DC |
1027 | } else { |
1028 | ASSERT(magic == cpu_to_be16(XFS_DA_NODE_MAGIC) || | |
1029 | magic == cpu_to_be16(XFS_DA3_NODE_MAGIC)); | |
1030 | } | |
1c4f3329 AE |
1031 | ASSERT(!blkinfo->forw); |
1032 | ASSERT(!blkinfo->back); | |
1033 | } | |
1034 | #else /* !DEBUG */ | |
1035 | #define xfs_da_blkinfo_onlychild_validate(blkinfo, level) | |
1036 | #endif /* !DEBUG */ | |
1037 | ||
1da177e4 LT |
1038 | /* |
1039 | * We have only one entry in the root. Copy the only remaining child of | |
1040 | * the old root to block 0 as the new root node. | |
1041 | */ | |
1042 | STATIC int | |
f5ea1100 DC |
1043 | xfs_da3_root_join( |
1044 | struct xfs_da_state *state, | |
1045 | struct xfs_da_state_blk *root_blk) | |
1da177e4 | 1046 | { |
f5ea1100 DC |
1047 | struct xfs_da_intnode *oldroot; |
1048 | struct xfs_da_args *args; | |
1049 | xfs_dablk_t child; | |
1050 | struct xfs_buf *bp; | |
1051 | struct xfs_da3_icnode_hdr oldroothdr; | |
1052 | struct xfs_da_node_entry *btree; | |
1053 | int error; | |
01ba43b8 | 1054 | struct xfs_inode *dp = state->args->dp; |
1da177e4 | 1055 | |
5a5881cd DC |
1056 | trace_xfs_da_root_join(state->args); |
1057 | ||
1da177e4 | 1058 | ASSERT(root_blk->magic == XFS_DA_NODE_MAGIC); |
f5ea1100 DC |
1059 | |
1060 | args = state->args; | |
1d9025e5 | 1061 | oldroot = root_blk->bp->b_addr; |
01ba43b8 | 1062 | dp->d_ops->node_hdr_from_disk(&oldroothdr, oldroot); |
f5ea1100 DC |
1063 | ASSERT(oldroothdr.forw == 0); |
1064 | ASSERT(oldroothdr.back == 0); | |
1da177e4 LT |
1065 | |
1066 | /* | |
1067 | * If the root has more than one child, then don't do anything. | |
1068 | */ | |
f5ea1100 DC |
1069 | if (oldroothdr.count > 1) |
1070 | return 0; | |
1da177e4 LT |
1071 | |
1072 | /* | |
1073 | * Read in the (only) child block, then copy those bytes into | |
1074 | * the root block's buffer and free the original child block. | |
1075 | */ | |
01ba43b8 | 1076 | btree = dp->d_ops->node_tree_p(oldroot); |
f5ea1100 | 1077 | child = be32_to_cpu(btree[0].before); |
1da177e4 | 1078 | ASSERT(child != 0); |
01ba43b8 | 1079 | error = xfs_da3_node_read(args->trans, dp, child, -1, &bp, |
d9392a4b | 1080 | args->whichfork); |
1da177e4 | 1081 | if (error) |
f5ea1100 DC |
1082 | return error; |
1083 | xfs_da_blkinfo_onlychild_validate(bp->b_addr, oldroothdr.level); | |
1c4f3329 | 1084 | |
612cfbfe DC |
1085 | /* |
1086 | * This could be copying a leaf back into the root block in the case of | |
1087 | * there only being a single leaf block left in the tree. Hence we have | |
1813dd64 | 1088 | * to update the b_ops pointer as well to match the buffer type change |
f5ea1100 DC |
1089 | * that could occur. For dir3 blocks we also need to update the block |
1090 | * number in the buffer header. | |
612cfbfe | 1091 | */ |
1d9025e5 | 1092 | memcpy(root_blk->bp->b_addr, bp->b_addr, state->blocksize); |
1813dd64 | 1093 | root_blk->bp->b_ops = bp->b_ops; |
d75afeb3 | 1094 | xfs_trans_buf_copy_type(root_blk->bp, bp); |
f5ea1100 DC |
1095 | if (oldroothdr.magic == XFS_DA3_NODE_MAGIC) { |
1096 | struct xfs_da3_blkinfo *da3 = root_blk->bp->b_addr; | |
1097 | da3->blkno = cpu_to_be64(root_blk->bp->b_bn); | |
1098 | } | |
1d9025e5 | 1099 | xfs_trans_log_buf(args->trans, root_blk->bp, 0, state->blocksize - 1); |
1da177e4 LT |
1100 | error = xfs_da_shrink_inode(args, child, bp); |
1101 | return(error); | |
1102 | } | |
1103 | ||
1104 | /* | |
1105 | * Check a node block and its neighbors to see if the block should be | |
1106 | * collapsed into one or the other neighbor. Always keep the block | |
1107 | * with the smaller block number. | |
1108 | * If the current block is over 50% full, don't try to join it, return 0. | |
1109 | * If the block is empty, fill in the state structure and return 2. | |
1110 | * If it can be collapsed, fill in the state structure and return 1. | |
1111 | * If nothing can be done, return 0. | |
1112 | */ | |
1113 | STATIC int | |
f5ea1100 DC |
1114 | xfs_da3_node_toosmall( |
1115 | struct xfs_da_state *state, | |
1116 | int *action) | |
1da177e4 | 1117 | { |
f5ea1100 DC |
1118 | struct xfs_da_intnode *node; |
1119 | struct xfs_da_state_blk *blk; | |
1120 | struct xfs_da_blkinfo *info; | |
1121 | xfs_dablk_t blkno; | |
1122 | struct xfs_buf *bp; | |
1123 | struct xfs_da3_icnode_hdr nodehdr; | |
1124 | int count; | |
1125 | int forward; | |
1126 | int error; | |
1127 | int retval; | |
1128 | int i; | |
01ba43b8 | 1129 | struct xfs_inode *dp = state->args->dp; |
1da177e4 | 1130 | |
ee73259b DC |
1131 | trace_xfs_da_node_toosmall(state->args); |
1132 | ||
1da177e4 LT |
1133 | /* |
1134 | * Check for the degenerate case of the block being over 50% full. | |
1135 | * If so, it's not worth even looking to see if we might be able | |
1136 | * to coalesce with a sibling. | |
1137 | */ | |
1138 | blk = &state->path.blk[ state->path.active-1 ]; | |
1d9025e5 | 1139 | info = blk->bp->b_addr; |
1da177e4 | 1140 | node = (xfs_da_intnode_t *)info; |
01ba43b8 | 1141 | dp->d_ops->node_hdr_from_disk(&nodehdr, node); |
f5ea1100 | 1142 | if (nodehdr.count > (state->node_ents >> 1)) { |
1da177e4 LT |
1143 | *action = 0; /* blk over 50%, don't try to join */ |
1144 | return(0); /* blk over 50%, don't try to join */ | |
1145 | } | |
1146 | ||
1147 | /* | |
1148 | * Check for the degenerate case of the block being empty. | |
1149 | * If the block is empty, we'll simply delete it, no need to | |
c41564b5 | 1150 | * coalesce it with a sibling block. We choose (arbitrarily) |
1da177e4 LT |
1151 | * to merge with the forward block unless it is NULL. |
1152 | */ | |
f5ea1100 | 1153 | if (nodehdr.count == 0) { |
1da177e4 LT |
1154 | /* |
1155 | * Make altpath point to the block we want to keep and | |
1156 | * path point to the block we want to drop (this one). | |
1157 | */ | |
89da0544 | 1158 | forward = (info->forw != 0); |
1da177e4 | 1159 | memcpy(&state->altpath, &state->path, sizeof(state->path)); |
f5ea1100 | 1160 | error = xfs_da3_path_shift(state, &state->altpath, forward, |
1da177e4 LT |
1161 | 0, &retval); |
1162 | if (error) | |
1163 | return(error); | |
1164 | if (retval) { | |
1165 | *action = 0; | |
1166 | } else { | |
1167 | *action = 2; | |
1168 | } | |
1169 | return(0); | |
1170 | } | |
1171 | ||
1172 | /* | |
1173 | * Examine each sibling block to see if we can coalesce with | |
1174 | * at least 25% free space to spare. We need to figure out | |
1175 | * whether to merge with the forward or the backward block. | |
1176 | * We prefer coalescing with the lower numbered sibling so as | |
1177 | * to shrink a directory over time. | |
1178 | */ | |
f5ea1100 DC |
1179 | count = state->node_ents; |
1180 | count -= state->node_ents >> 2; | |
1181 | count -= nodehdr.count; | |
1182 | ||
1da177e4 | 1183 | /* start with smaller blk num */ |
f5ea1100 | 1184 | forward = nodehdr.forw < nodehdr.back; |
1da177e4 | 1185 | for (i = 0; i < 2; forward = !forward, i++) { |
997def25 | 1186 | struct xfs_da3_icnode_hdr thdr; |
1da177e4 | 1187 | if (forward) |
f5ea1100 | 1188 | blkno = nodehdr.forw; |
1da177e4 | 1189 | else |
f5ea1100 | 1190 | blkno = nodehdr.back; |
1da177e4 LT |
1191 | if (blkno == 0) |
1192 | continue; | |
01ba43b8 | 1193 | error = xfs_da3_node_read(state->args->trans, dp, |
d9392a4b | 1194 | blkno, -1, &bp, state->args->whichfork); |
1da177e4 LT |
1195 | if (error) |
1196 | return(error); | |
1da177e4 | 1197 | |
1d9025e5 | 1198 | node = bp->b_addr; |
01ba43b8 | 1199 | dp->d_ops->node_hdr_from_disk(&thdr, node); |
1d9025e5 | 1200 | xfs_trans_brelse(state->args->trans, bp); |
f5ea1100 | 1201 | |
997def25 | 1202 | if (count - thdr.count >= 0) |
1da177e4 LT |
1203 | break; /* fits with at least 25% to spare */ |
1204 | } | |
1205 | if (i >= 2) { | |
1206 | *action = 0; | |
f5ea1100 | 1207 | return 0; |
1da177e4 LT |
1208 | } |
1209 | ||
1210 | /* | |
1211 | * Make altpath point to the block we want to keep (the lower | |
1212 | * numbered block) and path point to the block we want to drop. | |
1213 | */ | |
1214 | memcpy(&state->altpath, &state->path, sizeof(state->path)); | |
1215 | if (blkno < blk->blkno) { | |
f5ea1100 | 1216 | error = xfs_da3_path_shift(state, &state->altpath, forward, |
1da177e4 | 1217 | 0, &retval); |
1da177e4 | 1218 | } else { |
f5ea1100 | 1219 | error = xfs_da3_path_shift(state, &state->path, forward, |
1da177e4 | 1220 | 0, &retval); |
f5ea1100 DC |
1221 | } |
1222 | if (error) | |
1223 | return error; | |
1224 | if (retval) { | |
1225 | *action = 0; | |
1226 | return 0; | |
1da177e4 LT |
1227 | } |
1228 | *action = 1; | |
f5ea1100 DC |
1229 | return 0; |
1230 | } | |
1231 | ||
1232 | /* | |
1233 | * Pick up the last hashvalue from an intermediate node. | |
1234 | */ | |
1235 | STATIC uint | |
1236 | xfs_da3_node_lasthash( | |
4bceb18f | 1237 | struct xfs_inode *dp, |
f5ea1100 DC |
1238 | struct xfs_buf *bp, |
1239 | int *count) | |
1240 | { | |
1241 | struct xfs_da_intnode *node; | |
1242 | struct xfs_da_node_entry *btree; | |
1243 | struct xfs_da3_icnode_hdr nodehdr; | |
1244 | ||
1245 | node = bp->b_addr; | |
01ba43b8 | 1246 | dp->d_ops->node_hdr_from_disk(&nodehdr, node); |
f5ea1100 DC |
1247 | if (count) |
1248 | *count = nodehdr.count; | |
1249 | if (!nodehdr.count) | |
1250 | return 0; | |
4bceb18f | 1251 | btree = dp->d_ops->node_tree_p(node); |
f5ea1100 | 1252 | return be32_to_cpu(btree[nodehdr.count - 1].hashval); |
1da177e4 LT |
1253 | } |
1254 | ||
1255 | /* | |
1256 | * Walk back up the tree adjusting hash values as necessary, | |
1257 | * when we stop making changes, return. | |
1258 | */ | |
1259 | void | |
f5ea1100 DC |
1260 | xfs_da3_fixhashpath( |
1261 | struct xfs_da_state *state, | |
1262 | struct xfs_da_state_path *path) | |
1da177e4 | 1263 | { |
f5ea1100 DC |
1264 | struct xfs_da_state_blk *blk; |
1265 | struct xfs_da_intnode *node; | |
1266 | struct xfs_da_node_entry *btree; | |
1267 | xfs_dahash_t lasthash=0; | |
1268 | int level; | |
1269 | int count; | |
4bceb18f | 1270 | struct xfs_inode *dp = state->args->dp; |
1da177e4 | 1271 | |
ee73259b DC |
1272 | trace_xfs_da_fixhashpath(state->args); |
1273 | ||
1da177e4 LT |
1274 | level = path->active-1; |
1275 | blk = &path->blk[ level ]; | |
1276 | switch (blk->magic) { | |
1da177e4 LT |
1277 | case XFS_ATTR_LEAF_MAGIC: |
1278 | lasthash = xfs_attr_leaf_lasthash(blk->bp, &count); | |
1279 | if (count == 0) | |
1280 | return; | |
1281 | break; | |
1da177e4 | 1282 | case XFS_DIR2_LEAFN_MAGIC: |
4bceb18f | 1283 | lasthash = xfs_dir2_leafn_lasthash(dp, blk->bp, &count); |
1da177e4 LT |
1284 | if (count == 0) |
1285 | return; | |
1286 | break; | |
1287 | case XFS_DA_NODE_MAGIC: | |
4bceb18f | 1288 | lasthash = xfs_da3_node_lasthash(dp, blk->bp, &count); |
1da177e4 LT |
1289 | if (count == 0) |
1290 | return; | |
1291 | break; | |
1292 | } | |
1293 | for (blk--, level--; level >= 0; blk--, level--) { | |
f5ea1100 DC |
1294 | struct xfs_da3_icnode_hdr nodehdr; |
1295 | ||
1d9025e5 | 1296 | node = blk->bp->b_addr; |
01ba43b8 | 1297 | dp->d_ops->node_hdr_from_disk(&nodehdr, node); |
4bceb18f | 1298 | btree = dp->d_ops->node_tree_p(node); |
c88547a8 | 1299 | if (be32_to_cpu(btree[blk->index].hashval) == lasthash) |
1da177e4 LT |
1300 | break; |
1301 | blk->hashval = lasthash; | |
f5ea1100 | 1302 | btree[blk->index].hashval = cpu_to_be32(lasthash); |
1d9025e5 | 1303 | xfs_trans_log_buf(state->args->trans, blk->bp, |
f5ea1100 DC |
1304 | XFS_DA_LOGRANGE(node, &btree[blk->index], |
1305 | sizeof(*btree))); | |
1da177e4 | 1306 | |
f5ea1100 | 1307 | lasthash = be32_to_cpu(btree[nodehdr.count - 1].hashval); |
1da177e4 LT |
1308 | } |
1309 | } | |
1310 | ||
1311 | /* | |
1312 | * Remove an entry from an intermediate node. | |
1313 | */ | |
1314 | STATIC void | |
f5ea1100 DC |
1315 | xfs_da3_node_remove( |
1316 | struct xfs_da_state *state, | |
1317 | struct xfs_da_state_blk *drop_blk) | |
1da177e4 | 1318 | { |
f5ea1100 DC |
1319 | struct xfs_da_intnode *node; |
1320 | struct xfs_da3_icnode_hdr nodehdr; | |
1321 | struct xfs_da_node_entry *btree; | |
1322 | int index; | |
1323 | int tmp; | |
4bceb18f | 1324 | struct xfs_inode *dp = state->args->dp; |
1da177e4 | 1325 | |
5a5881cd DC |
1326 | trace_xfs_da_node_remove(state->args); |
1327 | ||
1d9025e5 | 1328 | node = drop_blk->bp->b_addr; |
01ba43b8 | 1329 | dp->d_ops->node_hdr_from_disk(&nodehdr, node); |
f5ea1100 | 1330 | ASSERT(drop_blk->index < nodehdr.count); |
1da177e4 LT |
1331 | ASSERT(drop_blk->index >= 0); |
1332 | ||
1333 | /* | |
1334 | * Copy over the offending entry, or just zero it out. | |
1335 | */ | |
f5ea1100 | 1336 | index = drop_blk->index; |
4bceb18f | 1337 | btree = dp->d_ops->node_tree_p(node); |
f5ea1100 DC |
1338 | if (index < nodehdr.count - 1) { |
1339 | tmp = nodehdr.count - index - 1; | |
1da177e4 | 1340 | tmp *= (uint)sizeof(xfs_da_node_entry_t); |
f5ea1100 | 1341 | memmove(&btree[index], &btree[index + 1], tmp); |
1d9025e5 | 1342 | xfs_trans_log_buf(state->args->trans, drop_blk->bp, |
f5ea1100 DC |
1343 | XFS_DA_LOGRANGE(node, &btree[index], tmp)); |
1344 | index = nodehdr.count - 1; | |
1da177e4 | 1345 | } |
f5ea1100 | 1346 | memset(&btree[index], 0, sizeof(xfs_da_node_entry_t)); |
1d9025e5 | 1347 | xfs_trans_log_buf(state->args->trans, drop_blk->bp, |
f5ea1100 DC |
1348 | XFS_DA_LOGRANGE(node, &btree[index], sizeof(btree[index]))); |
1349 | nodehdr.count -= 1; | |
01ba43b8 | 1350 | dp->d_ops->node_hdr_to_disk(node, &nodehdr); |
1d9025e5 | 1351 | xfs_trans_log_buf(state->args->trans, drop_blk->bp, |
1c9a5b2e | 1352 | XFS_DA_LOGRANGE(node, &node->hdr, dp->d_ops->node_hdr_size)); |
1da177e4 LT |
1353 | |
1354 | /* | |
1355 | * Copy the last hash value from the block to propagate upwards. | |
1356 | */ | |
f5ea1100 | 1357 | drop_blk->hashval = be32_to_cpu(btree[index - 1].hashval); |
1da177e4 LT |
1358 | } |
1359 | ||
1360 | /* | |
f5ea1100 | 1361 | * Unbalance the elements between two intermediate nodes, |
1da177e4 LT |
1362 | * move all Btree elements from one node into another. |
1363 | */ | |
1364 | STATIC void | |
f5ea1100 DC |
1365 | xfs_da3_node_unbalance( |
1366 | struct xfs_da_state *state, | |
1367 | struct xfs_da_state_blk *drop_blk, | |
1368 | struct xfs_da_state_blk *save_blk) | |
1da177e4 | 1369 | { |
f5ea1100 DC |
1370 | struct xfs_da_intnode *drop_node; |
1371 | struct xfs_da_intnode *save_node; | |
1372 | struct xfs_da_node_entry *drop_btree; | |
1373 | struct xfs_da_node_entry *save_btree; | |
1374 | struct xfs_da3_icnode_hdr drop_hdr; | |
1375 | struct xfs_da3_icnode_hdr save_hdr; | |
1376 | struct xfs_trans *tp; | |
1377 | int sindex; | |
1378 | int tmp; | |
4bceb18f | 1379 | struct xfs_inode *dp = state->args->dp; |
1da177e4 | 1380 | |
5a5881cd DC |
1381 | trace_xfs_da_node_unbalance(state->args); |
1382 | ||
1d9025e5 DC |
1383 | drop_node = drop_blk->bp->b_addr; |
1384 | save_node = save_blk->bp->b_addr; | |
01ba43b8 DC |
1385 | dp->d_ops->node_hdr_from_disk(&drop_hdr, drop_node); |
1386 | dp->d_ops->node_hdr_from_disk(&save_hdr, save_node); | |
4bceb18f DC |
1387 | drop_btree = dp->d_ops->node_tree_p(drop_node); |
1388 | save_btree = dp->d_ops->node_tree_p(save_node); | |
1da177e4 LT |
1389 | tp = state->args->trans; |
1390 | ||
1391 | /* | |
1392 | * If the dying block has lower hashvals, then move all the | |
1393 | * elements in the remaining block up to make a hole. | |
1394 | */ | |
f5ea1100 DC |
1395 | if ((be32_to_cpu(drop_btree[0].hashval) < |
1396 | be32_to_cpu(save_btree[0].hashval)) || | |
1397 | (be32_to_cpu(drop_btree[drop_hdr.count - 1].hashval) < | |
1398 | be32_to_cpu(save_btree[save_hdr.count - 1].hashval))) { | |
1399 | /* XXX: check this - is memmove dst correct? */ | |
1400 | tmp = save_hdr.count * sizeof(xfs_da_node_entry_t); | |
1401 | memmove(&save_btree[drop_hdr.count], &save_btree[0], tmp); | |
1402 | ||
1403 | sindex = 0; | |
1d9025e5 | 1404 | xfs_trans_log_buf(tp, save_blk->bp, |
f5ea1100 DC |
1405 | XFS_DA_LOGRANGE(save_node, &save_btree[0], |
1406 | (save_hdr.count + drop_hdr.count) * | |
1407 | sizeof(xfs_da_node_entry_t))); | |
1da177e4 | 1408 | } else { |
f5ea1100 | 1409 | sindex = save_hdr.count; |
1d9025e5 | 1410 | xfs_trans_log_buf(tp, save_blk->bp, |
f5ea1100 DC |
1411 | XFS_DA_LOGRANGE(save_node, &save_btree[sindex], |
1412 | drop_hdr.count * sizeof(xfs_da_node_entry_t))); | |
1da177e4 LT |
1413 | } |
1414 | ||
1415 | /* | |
1416 | * Move all the B-tree elements from drop_blk to save_blk. | |
1417 | */ | |
f5ea1100 DC |
1418 | tmp = drop_hdr.count * (uint)sizeof(xfs_da_node_entry_t); |
1419 | memcpy(&save_btree[sindex], &drop_btree[0], tmp); | |
1420 | save_hdr.count += drop_hdr.count; | |
1da177e4 | 1421 | |
01ba43b8 | 1422 | dp->d_ops->node_hdr_to_disk(save_node, &save_hdr); |
1d9025e5 | 1423 | xfs_trans_log_buf(tp, save_blk->bp, |
1da177e4 | 1424 | XFS_DA_LOGRANGE(save_node, &save_node->hdr, |
1c9a5b2e | 1425 | dp->d_ops->node_hdr_size)); |
1da177e4 LT |
1426 | |
1427 | /* | |
1428 | * Save the last hashval in the remaining block for upward propagation. | |
1429 | */ | |
f5ea1100 | 1430 | save_blk->hashval = be32_to_cpu(save_btree[save_hdr.count - 1].hashval); |
1da177e4 LT |
1431 | } |
1432 | ||
1433 | /*======================================================================== | |
1434 | * Routines used for finding things in the Btree. | |
1435 | *========================================================================*/ | |
1436 | ||
1437 | /* | |
1438 | * Walk down the Btree looking for a particular filename, filling | |
1439 | * in the state structure as we go. | |
1440 | * | |
1441 | * We will set the state structure to point to each of the elements | |
1442 | * in each of the nodes where either the hashval is or should be. | |
1443 | * | |
1444 | * We support duplicate hashval's so for each entry in the current | |
1445 | * node that could contain the desired hashval, descend. This is a | |
1446 | * pruned depth-first tree search. | |
1447 | */ | |
1448 | int /* error */ | |
f5ea1100 DC |
1449 | xfs_da3_node_lookup_int( |
1450 | struct xfs_da_state *state, | |
1451 | int *result) | |
1da177e4 | 1452 | { |
f5ea1100 DC |
1453 | struct xfs_da_state_blk *blk; |
1454 | struct xfs_da_blkinfo *curr; | |
1455 | struct xfs_da_intnode *node; | |
1456 | struct xfs_da_node_entry *btree; | |
1457 | struct xfs_da3_icnode_hdr nodehdr; | |
1458 | struct xfs_da_args *args; | |
1459 | xfs_dablk_t blkno; | |
1460 | xfs_dahash_t hashval; | |
1461 | xfs_dahash_t btreehashval; | |
1462 | int probe; | |
1463 | int span; | |
1464 | int max; | |
1465 | int error; | |
1466 | int retval; | |
4bceb18f | 1467 | struct xfs_inode *dp = state->args->dp; |
1da177e4 LT |
1468 | |
1469 | args = state->args; | |
1470 | ||
1471 | /* | |
1472 | * Descend thru the B-tree searching each level for the right | |
1473 | * node to use, until the right hashval is found. | |
1474 | */ | |
7dda6e86 | 1475 | blkno = (args->whichfork == XFS_DATA_FORK)? args->geo->leafblk : 0; |
1da177e4 LT |
1476 | for (blk = &state->path.blk[0], state->path.active = 1; |
1477 | state->path.active <= XFS_DA_NODE_MAXDEPTH; | |
1478 | blk++, state->path.active++) { | |
1479 | /* | |
1480 | * Read the next node down in the tree. | |
1481 | */ | |
1482 | blk->blkno = blkno; | |
f5ea1100 | 1483 | error = xfs_da3_node_read(args->trans, args->dp, blkno, |
d9392a4b | 1484 | -1, &blk->bp, args->whichfork); |
1da177e4 LT |
1485 | if (error) { |
1486 | blk->blkno = 0; | |
1487 | state->path.active--; | |
1488 | return(error); | |
1489 | } | |
1d9025e5 | 1490 | curr = blk->bp->b_addr; |
d432c80e | 1491 | blk->magic = be16_to_cpu(curr->magic); |
f5ea1100 | 1492 | |
517c2220 DC |
1493 | if (blk->magic == XFS_ATTR_LEAF_MAGIC || |
1494 | blk->magic == XFS_ATTR3_LEAF_MAGIC) { | |
1495 | blk->magic = XFS_ATTR_LEAF_MAGIC; | |
f5ea1100 DC |
1496 | blk->hashval = xfs_attr_leaf_lasthash(blk->bp, NULL); |
1497 | break; | |
1498 | } | |
1499 | ||
1500 | if (blk->magic == XFS_DIR2_LEAFN_MAGIC || | |
1501 | blk->magic == XFS_DIR3_LEAFN_MAGIC) { | |
1502 | blk->magic = XFS_DIR2_LEAFN_MAGIC; | |
4141956a DC |
1503 | blk->hashval = xfs_dir2_leafn_lasthash(args->dp, |
1504 | blk->bp, NULL); | |
f5ea1100 DC |
1505 | break; |
1506 | } | |
1507 | ||
1508 | blk->magic = XFS_DA_NODE_MAGIC; | |
1509 | ||
1da177e4 LT |
1510 | |
1511 | /* | |
1512 | * Search an intermediate node for a match. | |
1513 | */ | |
f5ea1100 | 1514 | node = blk->bp->b_addr; |
01ba43b8 | 1515 | dp->d_ops->node_hdr_from_disk(&nodehdr, node); |
4bceb18f | 1516 | btree = dp->d_ops->node_tree_p(node); |
1da177e4 | 1517 | |
f5ea1100 DC |
1518 | max = nodehdr.count; |
1519 | blk->hashval = be32_to_cpu(btree[max - 1].hashval); | |
1da177e4 | 1520 | |
f5ea1100 DC |
1521 | /* |
1522 | * Binary search. (note: small blocks will skip loop) | |
1523 | */ | |
1524 | probe = span = max / 2; | |
1525 | hashval = args->hashval; | |
1526 | while (span > 4) { | |
1527 | span /= 2; | |
1528 | btreehashval = be32_to_cpu(btree[probe].hashval); | |
1529 | if (btreehashval < hashval) | |
1530 | probe += span; | |
1531 | else if (btreehashval > hashval) | |
1532 | probe -= span; | |
1533 | else | |
1534 | break; | |
1535 | } | |
1536 | ASSERT((probe >= 0) && (probe < max)); | |
1537 | ASSERT((span <= 4) || | |
1538 | (be32_to_cpu(btree[probe].hashval) == hashval)); | |
1da177e4 | 1539 | |
f5ea1100 DC |
1540 | /* |
1541 | * Since we may have duplicate hashval's, find the first | |
1542 | * matching hashval in the node. | |
1543 | */ | |
1544 | while (probe > 0 && | |
1545 | be32_to_cpu(btree[probe].hashval) >= hashval) { | |
1546 | probe--; | |
1547 | } | |
1548 | while (probe < max && | |
1549 | be32_to_cpu(btree[probe].hashval) < hashval) { | |
1550 | probe++; | |
1551 | } | |
1552 | ||
1553 | /* | |
1554 | * Pick the right block to descend on. | |
1555 | */ | |
1556 | if (probe == max) { | |
1557 | blk->index = max - 1; | |
1558 | blkno = be32_to_cpu(btree[max - 1].before); | |
1559 | } else { | |
1560 | blk->index = probe; | |
1561 | blkno = be32_to_cpu(btree[probe].before); | |
1da177e4 LT |
1562 | } |
1563 | } | |
1564 | ||
1565 | /* | |
1566 | * A leaf block that ends in the hashval that we are interested in | |
1567 | * (final hashval == search hashval) means that the next block may | |
1568 | * contain more entries with the same hashval, shift upward to the | |
1569 | * next leaf and keep searching. | |
1570 | */ | |
1571 | for (;;) { | |
f6c2d1fa | 1572 | if (blk->magic == XFS_DIR2_LEAFN_MAGIC) { |
1da177e4 LT |
1573 | retval = xfs_dir2_leafn_lookup_int(blk->bp, args, |
1574 | &blk->index, state); | |
d432c80e | 1575 | } else if (blk->magic == XFS_ATTR_LEAF_MAGIC) { |
517c2220 | 1576 | retval = xfs_attr3_leaf_lookup_int(blk->bp, args); |
1da177e4 LT |
1577 | blk->index = args->index; |
1578 | args->blkno = blk->blkno; | |
d432c80e NS |
1579 | } else { |
1580 | ASSERT(0); | |
1581 | return XFS_ERROR(EFSCORRUPTED); | |
1da177e4 | 1582 | } |
1da177e4 LT |
1583 | if (((retval == ENOENT) || (retval == ENOATTR)) && |
1584 | (blk->hashval == args->hashval)) { | |
f5ea1100 | 1585 | error = xfs_da3_path_shift(state, &state->path, 1, 1, |
1da177e4 LT |
1586 | &retval); |
1587 | if (error) | |
1588 | return(error); | |
1589 | if (retval == 0) { | |
1590 | continue; | |
d432c80e | 1591 | } else if (blk->magic == XFS_ATTR_LEAF_MAGIC) { |
1da177e4 LT |
1592 | /* path_shift() gives ENOENT */ |
1593 | retval = XFS_ERROR(ENOATTR); | |
1594 | } | |
1da177e4 LT |
1595 | } |
1596 | break; | |
1597 | } | |
1598 | *result = retval; | |
1599 | return(0); | |
1600 | } | |
1601 | ||
1602 | /*======================================================================== | |
1603 | * Utility routines. | |
1604 | *========================================================================*/ | |
1605 | ||
f5ea1100 DC |
1606 | /* |
1607 | * Compare two intermediate nodes for "order". | |
1608 | */ | |
1609 | STATIC int | |
1610 | xfs_da3_node_order( | |
4bceb18f | 1611 | struct xfs_inode *dp, |
f5ea1100 DC |
1612 | struct xfs_buf *node1_bp, |
1613 | struct xfs_buf *node2_bp) | |
1614 | { | |
1615 | struct xfs_da_intnode *node1; | |
1616 | struct xfs_da_intnode *node2; | |
1617 | struct xfs_da_node_entry *btree1; | |
1618 | struct xfs_da_node_entry *btree2; | |
1619 | struct xfs_da3_icnode_hdr node1hdr; | |
1620 | struct xfs_da3_icnode_hdr node2hdr; | |
1621 | ||
1622 | node1 = node1_bp->b_addr; | |
1623 | node2 = node2_bp->b_addr; | |
01ba43b8 DC |
1624 | dp->d_ops->node_hdr_from_disk(&node1hdr, node1); |
1625 | dp->d_ops->node_hdr_from_disk(&node2hdr, node2); | |
4bceb18f DC |
1626 | btree1 = dp->d_ops->node_tree_p(node1); |
1627 | btree2 = dp->d_ops->node_tree_p(node2); | |
f5ea1100 DC |
1628 | |
1629 | if (node1hdr.count > 0 && node2hdr.count > 0 && | |
1630 | ((be32_to_cpu(btree2[0].hashval) < be32_to_cpu(btree1[0].hashval)) || | |
1631 | (be32_to_cpu(btree2[node2hdr.count - 1].hashval) < | |
1632 | be32_to_cpu(btree1[node1hdr.count - 1].hashval)))) { | |
1633 | return 1; | |
1634 | } | |
1635 | return 0; | |
1636 | } | |
1637 | ||
1da177e4 LT |
1638 | /* |
1639 | * Link a new block into a doubly linked list of blocks (of whatever type). | |
1640 | */ | |
1641 | int /* error */ | |
f5ea1100 DC |
1642 | xfs_da3_blk_link( |
1643 | struct xfs_da_state *state, | |
1644 | struct xfs_da_state_blk *old_blk, | |
1645 | struct xfs_da_state_blk *new_blk) | |
1da177e4 | 1646 | { |
f5ea1100 DC |
1647 | struct xfs_da_blkinfo *old_info; |
1648 | struct xfs_da_blkinfo *new_info; | |
1649 | struct xfs_da_blkinfo *tmp_info; | |
1650 | struct xfs_da_args *args; | |
1651 | struct xfs_buf *bp; | |
1652 | int before = 0; | |
1653 | int error; | |
4bceb18f | 1654 | struct xfs_inode *dp = state->args->dp; |
1da177e4 LT |
1655 | |
1656 | /* | |
1657 | * Set up environment. | |
1658 | */ | |
1659 | args = state->args; | |
1660 | ASSERT(args != NULL); | |
1d9025e5 DC |
1661 | old_info = old_blk->bp->b_addr; |
1662 | new_info = new_blk->bp->b_addr; | |
1da177e4 | 1663 | ASSERT(old_blk->magic == XFS_DA_NODE_MAGIC || |
f6c2d1fa | 1664 | old_blk->magic == XFS_DIR2_LEAFN_MAGIC || |
1da177e4 | 1665 | old_blk->magic == XFS_ATTR_LEAF_MAGIC); |
1da177e4 LT |
1666 | |
1667 | switch (old_blk->magic) { | |
1da177e4 LT |
1668 | case XFS_ATTR_LEAF_MAGIC: |
1669 | before = xfs_attr_leaf_order(old_blk->bp, new_blk->bp); | |
1670 | break; | |
1da177e4 | 1671 | case XFS_DIR2_LEAFN_MAGIC: |
4bceb18f | 1672 | before = xfs_dir2_leafn_order(dp, old_blk->bp, new_blk->bp); |
1da177e4 LT |
1673 | break; |
1674 | case XFS_DA_NODE_MAGIC: | |
4bceb18f | 1675 | before = xfs_da3_node_order(dp, old_blk->bp, new_blk->bp); |
1da177e4 LT |
1676 | break; |
1677 | } | |
1678 | ||
1679 | /* | |
1680 | * Link blocks in appropriate order. | |
1681 | */ | |
1682 | if (before) { | |
1683 | /* | |
1684 | * Link new block in before existing block. | |
1685 | */ | |
5a5881cd | 1686 | trace_xfs_da_link_before(args); |
89da0544 NS |
1687 | new_info->forw = cpu_to_be32(old_blk->blkno); |
1688 | new_info->back = old_info->back; | |
1689 | if (old_info->back) { | |
4bceb18f | 1690 | error = xfs_da3_node_read(args->trans, dp, |
89da0544 | 1691 | be32_to_cpu(old_info->back), |
d9392a4b | 1692 | -1, &bp, args->whichfork); |
1da177e4 LT |
1693 | if (error) |
1694 | return(error); | |
1695 | ASSERT(bp != NULL); | |
1d9025e5 | 1696 | tmp_info = bp->b_addr; |
f5ea1100 | 1697 | ASSERT(tmp_info->magic == old_info->magic); |
89da0544 NS |
1698 | ASSERT(be32_to_cpu(tmp_info->forw) == old_blk->blkno); |
1699 | tmp_info->forw = cpu_to_be32(new_blk->blkno); | |
1d9025e5 | 1700 | xfs_trans_log_buf(args->trans, bp, 0, sizeof(*tmp_info)-1); |
1da177e4 | 1701 | } |
89da0544 | 1702 | old_info->back = cpu_to_be32(new_blk->blkno); |
1da177e4 LT |
1703 | } else { |
1704 | /* | |
1705 | * Link new block in after existing block. | |
1706 | */ | |
5a5881cd | 1707 | trace_xfs_da_link_after(args); |
89da0544 NS |
1708 | new_info->forw = old_info->forw; |
1709 | new_info->back = cpu_to_be32(old_blk->blkno); | |
1710 | if (old_info->forw) { | |
4bceb18f | 1711 | error = xfs_da3_node_read(args->trans, dp, |
89da0544 | 1712 | be32_to_cpu(old_info->forw), |
d9392a4b | 1713 | -1, &bp, args->whichfork); |
1da177e4 LT |
1714 | if (error) |
1715 | return(error); | |
1716 | ASSERT(bp != NULL); | |
1d9025e5 | 1717 | tmp_info = bp->b_addr; |
89da0544 NS |
1718 | ASSERT(tmp_info->magic == old_info->magic); |
1719 | ASSERT(be32_to_cpu(tmp_info->back) == old_blk->blkno); | |
1720 | tmp_info->back = cpu_to_be32(new_blk->blkno); | |
1d9025e5 | 1721 | xfs_trans_log_buf(args->trans, bp, 0, sizeof(*tmp_info)-1); |
1da177e4 | 1722 | } |
89da0544 | 1723 | old_info->forw = cpu_to_be32(new_blk->blkno); |
1da177e4 LT |
1724 | } |
1725 | ||
1d9025e5 DC |
1726 | xfs_trans_log_buf(args->trans, old_blk->bp, 0, sizeof(*tmp_info) - 1); |
1727 | xfs_trans_log_buf(args->trans, new_blk->bp, 0, sizeof(*tmp_info) - 1); | |
1da177e4 LT |
1728 | return(0); |
1729 | } | |
1730 | ||
1da177e4 LT |
1731 | /* |
1732 | * Unlink a block from a doubly linked list of blocks. | |
1733 | */ | |
ba0f32d4 | 1734 | STATIC int /* error */ |
f5ea1100 DC |
1735 | xfs_da3_blk_unlink( |
1736 | struct xfs_da_state *state, | |
1737 | struct xfs_da_state_blk *drop_blk, | |
1738 | struct xfs_da_state_blk *save_blk) | |
1da177e4 | 1739 | { |
f5ea1100 DC |
1740 | struct xfs_da_blkinfo *drop_info; |
1741 | struct xfs_da_blkinfo *save_info; | |
1742 | struct xfs_da_blkinfo *tmp_info; | |
1743 | struct xfs_da_args *args; | |
1744 | struct xfs_buf *bp; | |
1745 | int error; | |
1da177e4 LT |
1746 | |
1747 | /* | |
1748 | * Set up environment. | |
1749 | */ | |
1750 | args = state->args; | |
1751 | ASSERT(args != NULL); | |
1d9025e5 DC |
1752 | save_info = save_blk->bp->b_addr; |
1753 | drop_info = drop_blk->bp->b_addr; | |
1da177e4 | 1754 | ASSERT(save_blk->magic == XFS_DA_NODE_MAGIC || |
f6c2d1fa | 1755 | save_blk->magic == XFS_DIR2_LEAFN_MAGIC || |
1da177e4 | 1756 | save_blk->magic == XFS_ATTR_LEAF_MAGIC); |
1da177e4 | 1757 | ASSERT(save_blk->magic == drop_blk->magic); |
89da0544 NS |
1758 | ASSERT((be32_to_cpu(save_info->forw) == drop_blk->blkno) || |
1759 | (be32_to_cpu(save_info->back) == drop_blk->blkno)); | |
1760 | ASSERT((be32_to_cpu(drop_info->forw) == save_blk->blkno) || | |
1761 | (be32_to_cpu(drop_info->back) == save_blk->blkno)); | |
1da177e4 LT |
1762 | |
1763 | /* | |
1764 | * Unlink the leaf block from the doubly linked chain of leaves. | |
1765 | */ | |
89da0544 | 1766 | if (be32_to_cpu(save_info->back) == drop_blk->blkno) { |
5a5881cd | 1767 | trace_xfs_da_unlink_back(args); |
89da0544 NS |
1768 | save_info->back = drop_info->back; |
1769 | if (drop_info->back) { | |
f5ea1100 | 1770 | error = xfs_da3_node_read(args->trans, args->dp, |
89da0544 | 1771 | be32_to_cpu(drop_info->back), |
d9392a4b | 1772 | -1, &bp, args->whichfork); |
1da177e4 LT |
1773 | if (error) |
1774 | return(error); | |
1775 | ASSERT(bp != NULL); | |
1d9025e5 | 1776 | tmp_info = bp->b_addr; |
89da0544 NS |
1777 | ASSERT(tmp_info->magic == save_info->magic); |
1778 | ASSERT(be32_to_cpu(tmp_info->forw) == drop_blk->blkno); | |
1779 | tmp_info->forw = cpu_to_be32(save_blk->blkno); | |
1d9025e5 | 1780 | xfs_trans_log_buf(args->trans, bp, 0, |
1da177e4 | 1781 | sizeof(*tmp_info) - 1); |
1da177e4 LT |
1782 | } |
1783 | } else { | |
5a5881cd | 1784 | trace_xfs_da_unlink_forward(args); |
89da0544 NS |
1785 | save_info->forw = drop_info->forw; |
1786 | if (drop_info->forw) { | |
f5ea1100 | 1787 | error = xfs_da3_node_read(args->trans, args->dp, |
89da0544 | 1788 | be32_to_cpu(drop_info->forw), |
d9392a4b | 1789 | -1, &bp, args->whichfork); |
1da177e4 LT |
1790 | if (error) |
1791 | return(error); | |
1792 | ASSERT(bp != NULL); | |
1d9025e5 | 1793 | tmp_info = bp->b_addr; |
89da0544 NS |
1794 | ASSERT(tmp_info->magic == save_info->magic); |
1795 | ASSERT(be32_to_cpu(tmp_info->back) == drop_blk->blkno); | |
1796 | tmp_info->back = cpu_to_be32(save_blk->blkno); | |
1d9025e5 | 1797 | xfs_trans_log_buf(args->trans, bp, 0, |
1da177e4 | 1798 | sizeof(*tmp_info) - 1); |
1da177e4 LT |
1799 | } |
1800 | } | |
1801 | ||
1d9025e5 | 1802 | xfs_trans_log_buf(args->trans, save_blk->bp, 0, sizeof(*save_info) - 1); |
1da177e4 LT |
1803 | return(0); |
1804 | } | |
1805 | ||
1806 | /* | |
1807 | * Move a path "forward" or "!forward" one block at the current level. | |
1808 | * | |
1809 | * This routine will adjust a "path" to point to the next block | |
1810 | * "forward" (higher hashvalues) or "!forward" (lower hashvals) in the | |
1811 | * Btree, including updating pointers to the intermediate nodes between | |
1812 | * the new bottom and the root. | |
1813 | */ | |
1814 | int /* error */ | |
f5ea1100 DC |
1815 | xfs_da3_path_shift( |
1816 | struct xfs_da_state *state, | |
1817 | struct xfs_da_state_path *path, | |
1818 | int forward, | |
1819 | int release, | |
1820 | int *result) | |
1da177e4 | 1821 | { |
f5ea1100 DC |
1822 | struct xfs_da_state_blk *blk; |
1823 | struct xfs_da_blkinfo *info; | |
1824 | struct xfs_da_intnode *node; | |
1825 | struct xfs_da_args *args; | |
1826 | struct xfs_da_node_entry *btree; | |
1827 | struct xfs_da3_icnode_hdr nodehdr; | |
1828 | xfs_dablk_t blkno = 0; | |
1829 | int level; | |
1830 | int error; | |
4bceb18f | 1831 | struct xfs_inode *dp = state->args->dp; |
1da177e4 | 1832 | |
ee73259b DC |
1833 | trace_xfs_da_path_shift(state->args); |
1834 | ||
1da177e4 LT |
1835 | /* |
1836 | * Roll up the Btree looking for the first block where our | |
1837 | * current index is not at the edge of the block. Note that | |
1838 | * we skip the bottom layer because we want the sibling block. | |
1839 | */ | |
1840 | args = state->args; | |
1841 | ASSERT(args != NULL); | |
1842 | ASSERT(path != NULL); | |
1843 | ASSERT((path->active > 0) && (path->active < XFS_DA_NODE_MAXDEPTH)); | |
1844 | level = (path->active-1) - 1; /* skip bottom layer in path */ | |
1845 | for (blk = &path->blk[level]; level >= 0; blk--, level--) { | |
1d9025e5 | 1846 | node = blk->bp->b_addr; |
01ba43b8 | 1847 | dp->d_ops->node_hdr_from_disk(&nodehdr, node); |
4bceb18f | 1848 | btree = dp->d_ops->node_tree_p(node); |
f5ea1100 DC |
1849 | |
1850 | if (forward && (blk->index < nodehdr.count - 1)) { | |
1da177e4 | 1851 | blk->index++; |
f5ea1100 | 1852 | blkno = be32_to_cpu(btree[blk->index].before); |
1da177e4 LT |
1853 | break; |
1854 | } else if (!forward && (blk->index > 0)) { | |
1855 | blk->index--; | |
f5ea1100 | 1856 | blkno = be32_to_cpu(btree[blk->index].before); |
1da177e4 LT |
1857 | break; |
1858 | } | |
1859 | } | |
1860 | if (level < 0) { | |
1861 | *result = XFS_ERROR(ENOENT); /* we're out of our tree */ | |
6a178100 | 1862 | ASSERT(args->op_flags & XFS_DA_OP_OKNOENT); |
1da177e4 LT |
1863 | return(0); |
1864 | } | |
1865 | ||
1866 | /* | |
1867 | * Roll down the edge of the subtree until we reach the | |
1868 | * same depth we were at originally. | |
1869 | */ | |
1870 | for (blk++, level++; level < path->active; blk++, level++) { | |
1871 | /* | |
1872 | * Release the old block. | |
1873 | * (if it's dirty, trans won't actually let go) | |
1874 | */ | |
1875 | if (release) | |
1d9025e5 | 1876 | xfs_trans_brelse(args->trans, blk->bp); |
1da177e4 LT |
1877 | |
1878 | /* | |
1879 | * Read the next child block. | |
1880 | */ | |
1881 | blk->blkno = blkno; | |
4bceb18f | 1882 | error = xfs_da3_node_read(args->trans, dp, blkno, -1, |
d9392a4b | 1883 | &blk->bp, args->whichfork); |
1da177e4 LT |
1884 | if (error) |
1885 | return(error); | |
1d9025e5 | 1886 | info = blk->bp->b_addr; |
69ef921b | 1887 | ASSERT(info->magic == cpu_to_be16(XFS_DA_NODE_MAGIC) || |
f5ea1100 | 1888 | info->magic == cpu_to_be16(XFS_DA3_NODE_MAGIC) || |
69ef921b | 1889 | info->magic == cpu_to_be16(XFS_DIR2_LEAFN_MAGIC) || |
24df33b4 | 1890 | info->magic == cpu_to_be16(XFS_DIR3_LEAFN_MAGIC) || |
517c2220 DC |
1891 | info->magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC) || |
1892 | info->magic == cpu_to_be16(XFS_ATTR3_LEAF_MAGIC)); | |
f5ea1100 DC |
1893 | |
1894 | ||
1895 | /* | |
1896 | * Note: we flatten the magic number to a single type so we | |
1897 | * don't have to compare against crc/non-crc types elsewhere. | |
1898 | */ | |
1899 | switch (be16_to_cpu(info->magic)) { | |
1900 | case XFS_DA_NODE_MAGIC: | |
1901 | case XFS_DA3_NODE_MAGIC: | |
1902 | blk->magic = XFS_DA_NODE_MAGIC; | |
1da177e4 | 1903 | node = (xfs_da_intnode_t *)info; |
01ba43b8 | 1904 | dp->d_ops->node_hdr_from_disk(&nodehdr, node); |
4bceb18f | 1905 | btree = dp->d_ops->node_tree_p(node); |
f5ea1100 | 1906 | blk->hashval = be32_to_cpu(btree[nodehdr.count - 1].hashval); |
1da177e4 LT |
1907 | if (forward) |
1908 | blk->index = 0; | |
1909 | else | |
f5ea1100 DC |
1910 | blk->index = nodehdr.count - 1; |
1911 | blkno = be32_to_cpu(btree[blk->index].before); | |
1912 | break; | |
1913 | case XFS_ATTR_LEAF_MAGIC: | |
517c2220 | 1914 | case XFS_ATTR3_LEAF_MAGIC: |
f5ea1100 | 1915 | blk->magic = XFS_ATTR_LEAF_MAGIC; |
1da177e4 LT |
1916 | ASSERT(level == path->active-1); |
1917 | blk->index = 0; | |
4141956a | 1918 | blk->hashval = xfs_attr_leaf_lasthash(blk->bp, NULL); |
f5ea1100 DC |
1919 | break; |
1920 | case XFS_DIR2_LEAFN_MAGIC: | |
1921 | case XFS_DIR3_LEAFN_MAGIC: | |
1922 | blk->magic = XFS_DIR2_LEAFN_MAGIC; | |
1923 | ASSERT(level == path->active-1); | |
1924 | blk->index = 0; | |
4141956a DC |
1925 | blk->hashval = xfs_dir2_leafn_lasthash(args->dp, |
1926 | blk->bp, NULL); | |
f5ea1100 DC |
1927 | break; |
1928 | default: | |
1929 | ASSERT(0); | |
1930 | break; | |
1da177e4 LT |
1931 | } |
1932 | } | |
1933 | *result = 0; | |
f5ea1100 | 1934 | return 0; |
1da177e4 LT |
1935 | } |
1936 | ||
1937 | ||
1938 | /*======================================================================== | |
1939 | * Utility routines. | |
1940 | *========================================================================*/ | |
1941 | ||
1942 | /* | |
1943 | * Implement a simple hash on a character string. | |
1944 | * Rotate the hash value by 7 bits, then XOR each character in. | |
1945 | * This is implemented with some source-level loop unrolling. | |
1946 | */ | |
1947 | xfs_dahash_t | |
a5687787 | 1948 | xfs_da_hashname(const __uint8_t *name, int namelen) |
1da177e4 LT |
1949 | { |
1950 | xfs_dahash_t hash; | |
1951 | ||
1da177e4 LT |
1952 | /* |
1953 | * Do four characters at a time as long as we can. | |
1954 | */ | |
1955 | for (hash = 0; namelen >= 4; namelen -= 4, name += 4) | |
1956 | hash = (name[0] << 21) ^ (name[1] << 14) ^ (name[2] << 7) ^ | |
1957 | (name[3] << 0) ^ rol32(hash, 7 * 4); | |
1958 | ||
1959 | /* | |
1960 | * Now do the rest of the characters. | |
1961 | */ | |
1962 | switch (namelen) { | |
1963 | case 3: | |
1964 | return (name[0] << 14) ^ (name[1] << 7) ^ (name[2] << 0) ^ | |
1965 | rol32(hash, 7 * 3); | |
1966 | case 2: | |
1967 | return (name[0] << 7) ^ (name[1] << 0) ^ rol32(hash, 7 * 2); | |
1968 | case 1: | |
1969 | return (name[0] << 0) ^ rol32(hash, 7 * 1); | |
2b3b6d07 | 1970 | default: /* case 0: */ |
1da177e4 LT |
1971 | return hash; |
1972 | } | |
1da177e4 LT |
1973 | } |
1974 | ||
5163f95a BN |
1975 | enum xfs_dacmp |
1976 | xfs_da_compname( | |
1977 | struct xfs_da_args *args, | |
2bc75421 DC |
1978 | const unsigned char *name, |
1979 | int len) | |
5163f95a BN |
1980 | { |
1981 | return (args->namelen == len && memcmp(args->name, name, len) == 0) ? | |
1982 | XFS_CMP_EXACT : XFS_CMP_DIFFERENT; | |
1983 | } | |
1984 | ||
1985 | static xfs_dahash_t | |
1986 | xfs_default_hashname( | |
1987 | struct xfs_name *name) | |
1988 | { | |
1989 | return xfs_da_hashname(name->name, name->len); | |
1990 | } | |
1991 | ||
1992 | const struct xfs_nameops xfs_default_nameops = { | |
1993 | .hashname = xfs_default_hashname, | |
1994 | .compname = xfs_da_compname | |
1995 | }; | |
1996 | ||
1da177e4 | 1997 | int |
77936d02 CH |
1998 | xfs_da_grow_inode_int( |
1999 | struct xfs_da_args *args, | |
2000 | xfs_fileoff_t *bno, | |
2001 | int count) | |
1da177e4 | 2002 | { |
77936d02 CH |
2003 | struct xfs_trans *tp = args->trans; |
2004 | struct xfs_inode *dp = args->dp; | |
2005 | int w = args->whichfork; | |
2006 | xfs_drfsbno_t nblks = dp->i_d.di_nblocks; | |
2007 | struct xfs_bmbt_irec map, *mapp; | |
2008 | int nmap, error, got, i, mapi; | |
1da177e4 | 2009 | |
1da177e4 LT |
2010 | /* |
2011 | * Find a spot in the file space to put the new block. | |
2012 | */ | |
77936d02 CH |
2013 | error = xfs_bmap_first_unused(tp, dp, count, bno, w); |
2014 | if (error) | |
1da177e4 | 2015 | return error; |
77936d02 | 2016 | |
1da177e4 LT |
2017 | /* |
2018 | * Try mapping it in one filesystem block. | |
2019 | */ | |
2020 | nmap = 1; | |
2021 | ASSERT(args->firstblock != NULL); | |
c0dc7828 DC |
2022 | error = xfs_bmapi_write(tp, dp, *bno, count, |
2023 | xfs_bmapi_aflag(w)|XFS_BMAPI_METADATA|XFS_BMAPI_CONTIG, | |
1da177e4 | 2024 | args->firstblock, args->total, &map, &nmap, |
77936d02 CH |
2025 | args->flist); |
2026 | if (error) | |
1da177e4 | 2027 | return error; |
77936d02 | 2028 | |
1da177e4 LT |
2029 | ASSERT(nmap <= 1); |
2030 | if (nmap == 1) { | |
2031 | mapp = ↦ | |
2032 | mapi = 1; | |
77936d02 CH |
2033 | } else if (nmap == 0 && count > 1) { |
2034 | xfs_fileoff_t b; | |
2035 | int c; | |
2036 | ||
2037 | /* | |
2038 | * If we didn't get it and the block might work if fragmented, | |
2039 | * try without the CONTIG flag. Loop until we get it all. | |
2040 | */ | |
1da177e4 | 2041 | mapp = kmem_alloc(sizeof(*mapp) * count, KM_SLEEP); |
77936d02 | 2042 | for (b = *bno, mapi = 0; b < *bno + count; ) { |
1da177e4 | 2043 | nmap = MIN(XFS_BMAP_MAX_NMAP, count); |
77936d02 | 2044 | c = (int)(*bno + count - b); |
c0dc7828 DC |
2045 | error = xfs_bmapi_write(tp, dp, b, c, |
2046 | xfs_bmapi_aflag(w)|XFS_BMAPI_METADATA, | |
1da177e4 | 2047 | args->firstblock, args->total, |
77936d02 CH |
2048 | &mapp[mapi], &nmap, args->flist); |
2049 | if (error) | |
2050 | goto out_free_map; | |
1da177e4 LT |
2051 | if (nmap < 1) |
2052 | break; | |
2053 | mapi += nmap; | |
2054 | b = mapp[mapi - 1].br_startoff + | |
2055 | mapp[mapi - 1].br_blockcount; | |
2056 | } | |
2057 | } else { | |
2058 | mapi = 0; | |
2059 | mapp = NULL; | |
2060 | } | |
77936d02 | 2061 | |
1da177e4 LT |
2062 | /* |
2063 | * Count the blocks we got, make sure it matches the total. | |
2064 | */ | |
2065 | for (i = 0, got = 0; i < mapi; i++) | |
2066 | got += mapp[i].br_blockcount; | |
77936d02 | 2067 | if (got != count || mapp[0].br_startoff != *bno || |
1da177e4 | 2068 | mapp[mapi - 1].br_startoff + mapp[mapi - 1].br_blockcount != |
77936d02 CH |
2069 | *bno + count) { |
2070 | error = XFS_ERROR(ENOSPC); | |
2071 | goto out_free_map; | |
1da177e4 | 2072 | } |
77936d02 | 2073 | |
a7444053 DC |
2074 | /* account for newly allocated blocks in reserved blocks total */ |
2075 | args->total -= dp->i_d.di_nblocks - nblks; | |
77936d02 CH |
2076 | |
2077 | out_free_map: | |
2078 | if (mapp != &map) | |
2079 | kmem_free(mapp); | |
2080 | return error; | |
2081 | } | |
2082 | ||
2083 | /* | |
2084 | * Add a block to the btree ahead of the file. | |
2085 | * Return the new block number to the caller. | |
2086 | */ | |
2087 | int | |
2088 | xfs_da_grow_inode( | |
2089 | struct xfs_da_args *args, | |
2090 | xfs_dablk_t *new_blkno) | |
2091 | { | |
2092 | xfs_fileoff_t bno; | |
77936d02 CH |
2093 | int error; |
2094 | ||
5a5881cd DC |
2095 | trace_xfs_da_grow_inode(args); |
2096 | ||
d6cf1305 DC |
2097 | bno = args->geo->leafblk; |
2098 | error = xfs_da_grow_inode_int(args, &bno, args->geo->fsbcount); | |
77936d02 CH |
2099 | if (!error) |
2100 | *new_blkno = (xfs_dablk_t)bno; | |
2101 | return error; | |
1da177e4 LT |
2102 | } |
2103 | ||
2104 | /* | |
2105 | * Ick. We need to always be able to remove a btree block, even | |
2106 | * if there's no space reservation because the filesystem is full. | |
2107 | * This is called if xfs_bunmapi on a btree block fails due to ENOSPC. | |
2108 | * It swaps the target block with the last block in the file. The | |
2109 | * last block in the file can always be removed since it can't cause | |
2110 | * a bmap btree split to do that. | |
2111 | */ | |
2112 | STATIC int | |
f5ea1100 DC |
2113 | xfs_da3_swap_lastblock( |
2114 | struct xfs_da_args *args, | |
2115 | xfs_dablk_t *dead_blknop, | |
2116 | struct xfs_buf **dead_bufp) | |
1da177e4 | 2117 | { |
f5ea1100 DC |
2118 | struct xfs_da_blkinfo *dead_info; |
2119 | struct xfs_da_blkinfo *sib_info; | |
2120 | struct xfs_da_intnode *par_node; | |
2121 | struct xfs_da_intnode *dead_node; | |
2122 | struct xfs_dir2_leaf *dead_leaf2; | |
2123 | struct xfs_da_node_entry *btree; | |
2124 | struct xfs_da3_icnode_hdr par_hdr; | |
4bceb18f | 2125 | struct xfs_inode *dp; |
f5ea1100 DC |
2126 | struct xfs_trans *tp; |
2127 | struct xfs_mount *mp; | |
2128 | struct xfs_buf *dead_buf; | |
2129 | struct xfs_buf *last_buf; | |
2130 | struct xfs_buf *sib_buf; | |
2131 | struct xfs_buf *par_buf; | |
2132 | xfs_dahash_t dead_hash; | |
2133 | xfs_fileoff_t lastoff; | |
2134 | xfs_dablk_t dead_blkno; | |
2135 | xfs_dablk_t last_blkno; | |
2136 | xfs_dablk_t sib_blkno; | |
2137 | xfs_dablk_t par_blkno; | |
2138 | int error; | |
2139 | int w; | |
2140 | int entno; | |
2141 | int level; | |
2142 | int dead_level; | |
1da177e4 | 2143 | |
5a5881cd DC |
2144 | trace_xfs_da_swap_lastblock(args); |
2145 | ||
1da177e4 LT |
2146 | dead_buf = *dead_bufp; |
2147 | dead_blkno = *dead_blknop; | |
2148 | tp = args->trans; | |
4bceb18f | 2149 | dp = args->dp; |
1da177e4 LT |
2150 | w = args->whichfork; |
2151 | ASSERT(w == XFS_DATA_FORK); | |
4bceb18f | 2152 | mp = dp->i_mount; |
7dda6e86 | 2153 | lastoff = args->geo->freeblk; |
4bceb18f | 2154 | error = xfs_bmap_last_before(tp, dp, &lastoff, w); |
1da177e4 LT |
2155 | if (error) |
2156 | return error; | |
2157 | if (unlikely(lastoff == 0)) { | |
2158 | XFS_ERROR_REPORT("xfs_da_swap_lastblock(1)", XFS_ERRLEVEL_LOW, | |
2159 | mp); | |
2160 | return XFS_ERROR(EFSCORRUPTED); | |
2161 | } | |
2162 | /* | |
2163 | * Read the last block in the btree space. | |
2164 | */ | |
d6cf1305 | 2165 | last_blkno = (xfs_dablk_t)lastoff - args->geo->fsbcount; |
4bceb18f | 2166 | error = xfs_da3_node_read(tp, dp, last_blkno, -1, &last_buf, w); |
4bb20a83 | 2167 | if (error) |
1da177e4 LT |
2168 | return error; |
2169 | /* | |
2170 | * Copy the last block into the dead buffer and log it. | |
2171 | */ | |
1d9025e5 DC |
2172 | memcpy(dead_buf->b_addr, last_buf->b_addr, mp->m_dirblksize); |
2173 | xfs_trans_log_buf(tp, dead_buf, 0, mp->m_dirblksize - 1); | |
2174 | dead_info = dead_buf->b_addr; | |
1da177e4 LT |
2175 | /* |
2176 | * Get values from the moved block. | |
2177 | */ | |
24df33b4 DC |
2178 | if (dead_info->magic == cpu_to_be16(XFS_DIR2_LEAFN_MAGIC) || |
2179 | dead_info->magic == cpu_to_be16(XFS_DIR3_LEAFN_MAGIC)) { | |
2180 | struct xfs_dir3_icleaf_hdr leafhdr; | |
2181 | struct xfs_dir2_leaf_entry *ents; | |
2182 | ||
1da177e4 | 2183 | dead_leaf2 = (xfs_dir2_leaf_t *)dead_info; |
01ba43b8 | 2184 | dp->d_ops->leaf_hdr_from_disk(&leafhdr, dead_leaf2); |
4bceb18f | 2185 | ents = dp->d_ops->leaf_ents_p(dead_leaf2); |
1da177e4 | 2186 | dead_level = 0; |
24df33b4 | 2187 | dead_hash = be32_to_cpu(ents[leafhdr.count - 1].hashval); |
1da177e4 | 2188 | } else { |
f5ea1100 DC |
2189 | struct xfs_da3_icnode_hdr deadhdr; |
2190 | ||
1da177e4 | 2191 | dead_node = (xfs_da_intnode_t *)dead_info; |
01ba43b8 | 2192 | dp->d_ops->node_hdr_from_disk(&deadhdr, dead_node); |
4bceb18f | 2193 | btree = dp->d_ops->node_tree_p(dead_node); |
f5ea1100 DC |
2194 | dead_level = deadhdr.level; |
2195 | dead_hash = be32_to_cpu(btree[deadhdr.count - 1].hashval); | |
1da177e4 LT |
2196 | } |
2197 | sib_buf = par_buf = NULL; | |
2198 | /* | |
2199 | * If the moved block has a left sibling, fix up the pointers. | |
2200 | */ | |
89da0544 | 2201 | if ((sib_blkno = be32_to_cpu(dead_info->back))) { |
4bceb18f | 2202 | error = xfs_da3_node_read(tp, dp, sib_blkno, -1, &sib_buf, w); |
4bb20a83 | 2203 | if (error) |
1da177e4 | 2204 | goto done; |
1d9025e5 | 2205 | sib_info = sib_buf->b_addr; |
1da177e4 | 2206 | if (unlikely( |
89da0544 NS |
2207 | be32_to_cpu(sib_info->forw) != last_blkno || |
2208 | sib_info->magic != dead_info->magic)) { | |
1da177e4 LT |
2209 | XFS_ERROR_REPORT("xfs_da_swap_lastblock(2)", |
2210 | XFS_ERRLEVEL_LOW, mp); | |
2211 | error = XFS_ERROR(EFSCORRUPTED); | |
2212 | goto done; | |
2213 | } | |
89da0544 | 2214 | sib_info->forw = cpu_to_be32(dead_blkno); |
1d9025e5 | 2215 | xfs_trans_log_buf(tp, sib_buf, |
1da177e4 LT |
2216 | XFS_DA_LOGRANGE(sib_info, &sib_info->forw, |
2217 | sizeof(sib_info->forw))); | |
1da177e4 LT |
2218 | sib_buf = NULL; |
2219 | } | |
2220 | /* | |
2221 | * If the moved block has a right sibling, fix up the pointers. | |
2222 | */ | |
89da0544 | 2223 | if ((sib_blkno = be32_to_cpu(dead_info->forw))) { |
4bceb18f | 2224 | error = xfs_da3_node_read(tp, dp, sib_blkno, -1, &sib_buf, w); |
4bb20a83 | 2225 | if (error) |
1da177e4 | 2226 | goto done; |
1d9025e5 | 2227 | sib_info = sib_buf->b_addr; |
1da177e4 | 2228 | if (unlikely( |
89da0544 NS |
2229 | be32_to_cpu(sib_info->back) != last_blkno || |
2230 | sib_info->magic != dead_info->magic)) { | |
1da177e4 LT |
2231 | XFS_ERROR_REPORT("xfs_da_swap_lastblock(3)", |
2232 | XFS_ERRLEVEL_LOW, mp); | |
2233 | error = XFS_ERROR(EFSCORRUPTED); | |
2234 | goto done; | |
2235 | } | |
89da0544 | 2236 | sib_info->back = cpu_to_be32(dead_blkno); |
1d9025e5 | 2237 | xfs_trans_log_buf(tp, sib_buf, |
1da177e4 LT |
2238 | XFS_DA_LOGRANGE(sib_info, &sib_info->back, |
2239 | sizeof(sib_info->back))); | |
1da177e4 LT |
2240 | sib_buf = NULL; |
2241 | } | |
7dda6e86 | 2242 | par_blkno = args->geo->leafblk; |
1da177e4 LT |
2243 | level = -1; |
2244 | /* | |
2245 | * Walk down the tree looking for the parent of the moved block. | |
2246 | */ | |
2247 | for (;;) { | |
4bceb18f | 2248 | error = xfs_da3_node_read(tp, dp, par_blkno, -1, &par_buf, w); |
4bb20a83 | 2249 | if (error) |
1da177e4 | 2250 | goto done; |
1d9025e5 | 2251 | par_node = par_buf->b_addr; |
01ba43b8 | 2252 | dp->d_ops->node_hdr_from_disk(&par_hdr, par_node); |
f5ea1100 | 2253 | if (level >= 0 && level != par_hdr.level + 1) { |
1da177e4 LT |
2254 | XFS_ERROR_REPORT("xfs_da_swap_lastblock(4)", |
2255 | XFS_ERRLEVEL_LOW, mp); | |
2256 | error = XFS_ERROR(EFSCORRUPTED); | |
2257 | goto done; | |
2258 | } | |
f5ea1100 | 2259 | level = par_hdr.level; |
4bceb18f | 2260 | btree = dp->d_ops->node_tree_p(par_node); |
1da177e4 | 2261 | for (entno = 0; |
f5ea1100 DC |
2262 | entno < par_hdr.count && |
2263 | be32_to_cpu(btree[entno].hashval) < dead_hash; | |
1da177e4 LT |
2264 | entno++) |
2265 | continue; | |
f5ea1100 | 2266 | if (entno == par_hdr.count) { |
1da177e4 LT |
2267 | XFS_ERROR_REPORT("xfs_da_swap_lastblock(5)", |
2268 | XFS_ERRLEVEL_LOW, mp); | |
2269 | error = XFS_ERROR(EFSCORRUPTED); | |
2270 | goto done; | |
2271 | } | |
f5ea1100 | 2272 | par_blkno = be32_to_cpu(btree[entno].before); |
1da177e4 LT |
2273 | if (level == dead_level + 1) |
2274 | break; | |
1d9025e5 | 2275 | xfs_trans_brelse(tp, par_buf); |
1da177e4 LT |
2276 | par_buf = NULL; |
2277 | } | |
2278 | /* | |
2279 | * We're in the right parent block. | |
2280 | * Look for the right entry. | |
2281 | */ | |
2282 | for (;;) { | |
2283 | for (; | |
f5ea1100 DC |
2284 | entno < par_hdr.count && |
2285 | be32_to_cpu(btree[entno].before) != last_blkno; | |
1da177e4 LT |
2286 | entno++) |
2287 | continue; | |
f5ea1100 | 2288 | if (entno < par_hdr.count) |
1da177e4 | 2289 | break; |
f5ea1100 | 2290 | par_blkno = par_hdr.forw; |
1d9025e5 | 2291 | xfs_trans_brelse(tp, par_buf); |
1da177e4 LT |
2292 | par_buf = NULL; |
2293 | if (unlikely(par_blkno == 0)) { | |
2294 | XFS_ERROR_REPORT("xfs_da_swap_lastblock(6)", | |
2295 | XFS_ERRLEVEL_LOW, mp); | |
2296 | error = XFS_ERROR(EFSCORRUPTED); | |
2297 | goto done; | |
2298 | } | |
4bceb18f | 2299 | error = xfs_da3_node_read(tp, dp, par_blkno, -1, &par_buf, w); |
4bb20a83 | 2300 | if (error) |
1da177e4 | 2301 | goto done; |
1d9025e5 | 2302 | par_node = par_buf->b_addr; |
01ba43b8 | 2303 | dp->d_ops->node_hdr_from_disk(&par_hdr, par_node); |
f5ea1100 | 2304 | if (par_hdr.level != level) { |
1da177e4 LT |
2305 | XFS_ERROR_REPORT("xfs_da_swap_lastblock(7)", |
2306 | XFS_ERRLEVEL_LOW, mp); | |
2307 | error = XFS_ERROR(EFSCORRUPTED); | |
2308 | goto done; | |
2309 | } | |
4bceb18f | 2310 | btree = dp->d_ops->node_tree_p(par_node); |
1da177e4 LT |
2311 | entno = 0; |
2312 | } | |
2313 | /* | |
2314 | * Update the parent entry pointing to the moved block. | |
2315 | */ | |
f5ea1100 | 2316 | btree[entno].before = cpu_to_be32(dead_blkno); |
1d9025e5 | 2317 | xfs_trans_log_buf(tp, par_buf, |
f5ea1100 DC |
2318 | XFS_DA_LOGRANGE(par_node, &btree[entno].before, |
2319 | sizeof(btree[entno].before))); | |
1da177e4 LT |
2320 | *dead_blknop = last_blkno; |
2321 | *dead_bufp = last_buf; | |
2322 | return 0; | |
2323 | done: | |
2324 | if (par_buf) | |
1d9025e5 | 2325 | xfs_trans_brelse(tp, par_buf); |
1da177e4 | 2326 | if (sib_buf) |
1d9025e5 DC |
2327 | xfs_trans_brelse(tp, sib_buf); |
2328 | xfs_trans_brelse(tp, last_buf); | |
1da177e4 LT |
2329 | return error; |
2330 | } | |
2331 | ||
2332 | /* | |
2333 | * Remove a btree block from a directory or attribute. | |
2334 | */ | |
2335 | int | |
1d9025e5 DC |
2336 | xfs_da_shrink_inode( |
2337 | xfs_da_args_t *args, | |
2338 | xfs_dablk_t dead_blkno, | |
2339 | struct xfs_buf *dead_buf) | |
1da177e4 LT |
2340 | { |
2341 | xfs_inode_t *dp; | |
2342 | int done, error, w, count; | |
1da177e4 LT |
2343 | xfs_trans_t *tp; |
2344 | xfs_mount_t *mp; | |
2345 | ||
5a5881cd DC |
2346 | trace_xfs_da_shrink_inode(args); |
2347 | ||
1da177e4 LT |
2348 | dp = args->dp; |
2349 | w = args->whichfork; | |
2350 | tp = args->trans; | |
2351 | mp = dp->i_mount; | |
d6cf1305 | 2352 | count = args->geo->fsbcount; |
1da177e4 LT |
2353 | for (;;) { |
2354 | /* | |
2355 | * Remove extents. If we get ENOSPC for a dir we have to move | |
2356 | * the last block to the place we want to kill. | |
2357 | */ | |
f5ea1100 DC |
2358 | error = xfs_bunmapi(tp, dp, dead_blkno, count, |
2359 | xfs_bmapi_aflag(w)|XFS_BMAPI_METADATA, | |
2360 | 0, args->firstblock, args->flist, &done); | |
2361 | if (error == ENOSPC) { | |
1da177e4 | 2362 | if (w != XFS_DATA_FORK) |
f6c2d1fa | 2363 | break; |
f5ea1100 DC |
2364 | error = xfs_da3_swap_lastblock(args, &dead_blkno, |
2365 | &dead_buf); | |
2366 | if (error) | |
f6c2d1fa NS |
2367 | break; |
2368 | } else { | |
1da177e4 | 2369 | break; |
1da177e4 LT |
2370 | } |
2371 | } | |
1d9025e5 | 2372 | xfs_trans_binval(tp, dead_buf); |
1da177e4 LT |
2373 | return error; |
2374 | } | |
2375 | ||
2376 | /* | |
2377 | * See if the mapping(s) for this btree block are valid, i.e. | |
2378 | * don't contain holes, are logically contiguous, and cover the whole range. | |
2379 | */ | |
2380 | STATIC int | |
2381 | xfs_da_map_covers_blocks( | |
2382 | int nmap, | |
2383 | xfs_bmbt_irec_t *mapp, | |
2384 | xfs_dablk_t bno, | |
2385 | int count) | |
2386 | { | |
2387 | int i; | |
2388 | xfs_fileoff_t off; | |
2389 | ||
2390 | for (i = 0, off = bno; i < nmap; i++) { | |
2391 | if (mapp[i].br_startblock == HOLESTARTBLOCK || | |
2392 | mapp[i].br_startblock == DELAYSTARTBLOCK) { | |
2393 | return 0; | |
2394 | } | |
2395 | if (off != mapp[i].br_startoff) { | |
2396 | return 0; | |
2397 | } | |
2398 | off += mapp[i].br_blockcount; | |
2399 | } | |
2400 | return off == bno + count; | |
2401 | } | |
2402 | ||
2403 | /* | |
3605431f DC |
2404 | * Convert a struct xfs_bmbt_irec to a struct xfs_buf_map. |
2405 | * | |
2406 | * For the single map case, it is assumed that the caller has provided a pointer | |
2407 | * to a valid xfs_buf_map. For the multiple map case, this function will | |
2408 | * allocate the xfs_buf_map to hold all the maps and replace the caller's single | |
2409 | * map pointer with the allocated map. | |
1da177e4 | 2410 | */ |
3605431f DC |
2411 | static int |
2412 | xfs_buf_map_from_irec( | |
2413 | struct xfs_mount *mp, | |
2414 | struct xfs_buf_map **mapp, | |
836a94ad | 2415 | int *nmaps, |
3605431f | 2416 | struct xfs_bmbt_irec *irecs, |
836a94ad | 2417 | int nirecs) |
1da177e4 | 2418 | { |
3605431f DC |
2419 | struct xfs_buf_map *map; |
2420 | int i; | |
2421 | ||
2422 | ASSERT(*nmaps == 1); | |
2423 | ASSERT(nirecs >= 1); | |
2424 | ||
2425 | if (nirecs > 1) { | |
b17cb364 DC |
2426 | map = kmem_zalloc(nirecs * sizeof(struct xfs_buf_map), |
2427 | KM_SLEEP | KM_NOFS); | |
3605431f DC |
2428 | if (!map) |
2429 | return ENOMEM; | |
2430 | *mapp = map; | |
2431 | } | |
2432 | ||
2433 | *nmaps = nirecs; | |
2434 | map = *mapp; | |
2435 | for (i = 0; i < *nmaps; i++) { | |
2436 | ASSERT(irecs[i].br_startblock != DELAYSTARTBLOCK && | |
2437 | irecs[i].br_startblock != HOLESTARTBLOCK); | |
2438 | map[i].bm_bn = XFS_FSB_TO_DADDR(mp, irecs[i].br_startblock); | |
2439 | map[i].bm_len = XFS_FSB_TO_BB(mp, irecs[i].br_blockcount); | |
2440 | } | |
2441 | return 0; | |
2442 | } | |
2443 | ||
2444 | /* | |
2445 | * Map the block we are given ready for reading. There are three possible return | |
2446 | * values: | |
2447 | * -1 - will be returned if we land in a hole and mappedbno == -2 so the | |
2448 | * caller knows not to execute a subsequent read. | |
2449 | * 0 - if we mapped the block successfully | |
2450 | * >0 - positive error number if there was an error. | |
2451 | */ | |
2452 | static int | |
2453 | xfs_dabuf_map( | |
3605431f DC |
2454 | struct xfs_inode *dp, |
2455 | xfs_dablk_t bno, | |
2456 | xfs_daddr_t mappedbno, | |
2457 | int whichfork, | |
2458 | struct xfs_buf_map **map, | |
2459 | int *nmaps) | |
2460 | { | |
2461 | struct xfs_mount *mp = dp->i_mount; | |
2462 | int nfsb; | |
2463 | int error = 0; | |
2464 | struct xfs_bmbt_irec irec; | |
2465 | struct xfs_bmbt_irec *irecs = &irec; | |
2466 | int nirecs; | |
2467 | ||
2468 | ASSERT(map && *map); | |
2469 | ASSERT(*nmaps == 1); | |
1da177e4 | 2470 | |
d6cf1305 DC |
2471 | if (whichfork == XFS_DATA_FORK) |
2472 | nfsb = mp->m_dir_geo->fsbcount; | |
2473 | else | |
2474 | nfsb = mp->m_attr_geo->fsbcount; | |
3605431f | 2475 | |
1da177e4 LT |
2476 | /* |
2477 | * Caller doesn't have a mapping. -2 means don't complain | |
2478 | * if we land in a hole. | |
2479 | */ | |
2480 | if (mappedbno == -1 || mappedbno == -2) { | |
2481 | /* | |
2482 | * Optimize the one-block case. | |
2483 | */ | |
3605431f | 2484 | if (nfsb != 1) |
b17cb364 DC |
2485 | irecs = kmem_zalloc(sizeof(irec) * nfsb, |
2486 | KM_SLEEP | KM_NOFS); | |
5b777ad5 | 2487 | |
3605431f DC |
2488 | nirecs = nfsb; |
2489 | error = xfs_bmapi_read(dp, (xfs_fileoff_t)bno, nfsb, irecs, | |
2490 | &nirecs, xfs_bmapi_aflag(whichfork)); | |
5b777ad5 | 2491 | if (error) |
3605431f | 2492 | goto out; |
1da177e4 | 2493 | } else { |
3605431f DC |
2494 | irecs->br_startblock = XFS_DADDR_TO_FSB(mp, mappedbno); |
2495 | irecs->br_startoff = (xfs_fileoff_t)bno; | |
2496 | irecs->br_blockcount = nfsb; | |
2497 | irecs->br_state = 0; | |
2498 | nirecs = 1; | |
1da177e4 | 2499 | } |
3605431f DC |
2500 | |
2501 | if (!xfs_da_map_covers_blocks(nirecs, irecs, bno, nfsb)) { | |
2502 | error = mappedbno == -2 ? -1 : XFS_ERROR(EFSCORRUPTED); | |
1da177e4 LT |
2503 | if (unlikely(error == EFSCORRUPTED)) { |
2504 | if (xfs_error_level >= XFS_ERRLEVEL_LOW) { | |
3605431f | 2505 | int i; |
0b932ccc DC |
2506 | xfs_alert(mp, "%s: bno %lld dir: inode %lld", |
2507 | __func__, (long long)bno, | |
1da177e4 | 2508 | (long long)dp->i_ino); |
3605431f | 2509 | for (i = 0; i < *nmaps; i++) { |
0b932ccc DC |
2510 | xfs_alert(mp, |
2511 | "[%02d] br_startoff %lld br_startblock %lld br_blockcount %lld br_state %d", | |
1da177e4 | 2512 | i, |
3605431f DC |
2513 | (long long)irecs[i].br_startoff, |
2514 | (long long)irecs[i].br_startblock, | |
2515 | (long long)irecs[i].br_blockcount, | |
2516 | irecs[i].br_state); | |
1da177e4 LT |
2517 | } |
2518 | } | |
2519 | XFS_ERROR_REPORT("xfs_da_do_buf(1)", | |
2520 | XFS_ERRLEVEL_LOW, mp); | |
2521 | } | |
3605431f | 2522 | goto out; |
1da177e4 | 2523 | } |
3605431f DC |
2524 | error = xfs_buf_map_from_irec(mp, map, nmaps, irecs, nirecs); |
2525 | out: | |
2526 | if (irecs != &irec) | |
2527 | kmem_free(irecs); | |
2528 | return error; | |
2529 | } | |
2530 | ||
2531 | /* | |
2532 | * Get a buffer for the dir/attr block. | |
2533 | */ | |
2534 | int | |
2535 | xfs_da_get_buf( | |
2536 | struct xfs_trans *trans, | |
2537 | struct xfs_inode *dp, | |
2538 | xfs_dablk_t bno, | |
2539 | xfs_daddr_t mappedbno, | |
1d9025e5 | 2540 | struct xfs_buf **bpp, |
3605431f DC |
2541 | int whichfork) |
2542 | { | |
2543 | struct xfs_buf *bp; | |
2544 | struct xfs_buf_map map; | |
2545 | struct xfs_buf_map *mapp; | |
2546 | int nmap; | |
2547 | int error; | |
2548 | ||
2549 | *bpp = NULL; | |
2550 | mapp = ↦ | |
2551 | nmap = 1; | |
9df2dd0b | 2552 | error = xfs_dabuf_map(dp, bno, mappedbno, whichfork, |
3605431f DC |
2553 | &mapp, &nmap); |
2554 | if (error) { | |
2555 | /* mapping a hole is not an error, but we don't continue */ | |
2556 | if (error == -1) | |
1da177e4 | 2557 | error = 0; |
3605431f | 2558 | goto out_free; |
1da177e4 | 2559 | } |
3605431f DC |
2560 | |
2561 | bp = xfs_trans_get_buf_map(trans, dp->i_mount->m_ddev_targp, | |
2562 | mapp, nmap, 0); | |
2563 | error = bp ? bp->b_error : XFS_ERROR(EIO); | |
2564 | if (error) { | |
2565 | xfs_trans_brelse(trans, bp); | |
2566 | goto out_free; | |
2567 | } | |
2568 | ||
1d9025e5 | 2569 | *bpp = bp; |
3605431f DC |
2570 | |
2571 | out_free: | |
2572 | if (mapp != &map) | |
2573 | kmem_free(mapp); | |
2574 | ||
2575 | return error; | |
2576 | } | |
2577 | ||
2578 | /* | |
2579 | * Get a buffer for the dir/attr block, fill in the contents. | |
2580 | */ | |
2581 | int | |
2582 | xfs_da_read_buf( | |
2583 | struct xfs_trans *trans, | |
2584 | struct xfs_inode *dp, | |
2585 | xfs_dablk_t bno, | |
2586 | xfs_daddr_t mappedbno, | |
1d9025e5 | 2587 | struct xfs_buf **bpp, |
4bb20a83 | 2588 | int whichfork, |
1813dd64 | 2589 | const struct xfs_buf_ops *ops) |
3605431f DC |
2590 | { |
2591 | struct xfs_buf *bp; | |
2592 | struct xfs_buf_map map; | |
2593 | struct xfs_buf_map *mapp; | |
2594 | int nmap; | |
2595 | int error; | |
2596 | ||
2597 | *bpp = NULL; | |
2598 | mapp = ↦ | |
2599 | nmap = 1; | |
9df2dd0b | 2600 | error = xfs_dabuf_map(dp, bno, mappedbno, whichfork, |
3605431f DC |
2601 | &mapp, &nmap); |
2602 | if (error) { | |
2603 | /* mapping a hole is not an error, but we don't continue */ | |
2604 | if (error == -1) | |
2605 | error = 0; | |
2606 | goto out_free; | |
2607 | } | |
2608 | ||
2609 | error = xfs_trans_read_buf_map(dp->i_mount, trans, | |
2610 | dp->i_mount->m_ddev_targp, | |
1813dd64 | 2611 | mapp, nmap, 0, &bp, ops); |
3605431f DC |
2612 | if (error) |
2613 | goto out_free; | |
2614 | ||
2615 | if (whichfork == XFS_ATTR_FORK) | |
2616 | xfs_buf_set_ref(bp, XFS_ATTR_BTREE_REF); | |
1da177e4 | 2617 | else |
3605431f DC |
2618 | xfs_buf_set_ref(bp, XFS_DIR_BTREE_REF); |
2619 | ||
1da177e4 | 2620 | /* |
3605431f DC |
2621 | * This verification code will be moved to a CRC verification callback |
2622 | * function so just leave it here unchanged until then. | |
1da177e4 | 2623 | */ |
3605431f | 2624 | { |
1d9025e5 DC |
2625 | xfs_dir2_data_hdr_t *hdr = bp->b_addr; |
2626 | xfs_dir2_free_t *free = bp->b_addr; | |
2627 | xfs_da_blkinfo_t *info = bp->b_addr; | |
1da177e4 | 2628 | uint magic, magic1; |
3605431f | 2629 | struct xfs_mount *mp = dp->i_mount; |
1da177e4 | 2630 | |
89da0544 | 2631 | magic = be16_to_cpu(info->magic); |
c2066e26 | 2632 | magic1 = be32_to_cpu(hdr->magic); |
1da177e4 LT |
2633 | if (unlikely( |
2634 | XFS_TEST_ERROR((magic != XFS_DA_NODE_MAGIC) && | |
f5ea1100 | 2635 | (magic != XFS_DA3_NODE_MAGIC) && |
1da177e4 | 2636 | (magic != XFS_ATTR_LEAF_MAGIC) && |
517c2220 | 2637 | (magic != XFS_ATTR3_LEAF_MAGIC) && |
1da177e4 | 2638 | (magic != XFS_DIR2_LEAF1_MAGIC) && |
24df33b4 | 2639 | (magic != XFS_DIR3_LEAF1_MAGIC) && |
1da177e4 | 2640 | (magic != XFS_DIR2_LEAFN_MAGIC) && |
24df33b4 | 2641 | (magic != XFS_DIR3_LEAFN_MAGIC) && |
1da177e4 | 2642 | (magic1 != XFS_DIR2_BLOCK_MAGIC) && |
24df33b4 | 2643 | (magic1 != XFS_DIR3_BLOCK_MAGIC) && |
1da177e4 | 2644 | (magic1 != XFS_DIR2_DATA_MAGIC) && |
24df33b4 DC |
2645 | (magic1 != XFS_DIR3_DATA_MAGIC) && |
2646 | (free->hdr.magic != | |
2647 | cpu_to_be32(XFS_DIR2_FREE_MAGIC)) && | |
2648 | (free->hdr.magic != | |
2649 | cpu_to_be32(XFS_DIR3_FREE_MAGIC)), | |
1da177e4 LT |
2650 | mp, XFS_ERRTAG_DA_READ_BUF, |
2651 | XFS_RANDOM_DA_READ_BUF))) { | |
3605431f | 2652 | trace_xfs_da_btree_corrupt(bp, _RET_IP_); |
1da177e4 LT |
2653 | XFS_CORRUPTION_ERROR("xfs_da_do_buf(2)", |
2654 | XFS_ERRLEVEL_LOW, mp, info); | |
2655 | error = XFS_ERROR(EFSCORRUPTED); | |
1d9025e5 | 2656 | xfs_trans_brelse(trans, bp); |
3605431f | 2657 | goto out_free; |
1da177e4 LT |
2658 | } |
2659 | } | |
1d9025e5 | 2660 | *bpp = bp; |
3605431f | 2661 | out_free: |
1da177e4 | 2662 | if (mapp != &map) |
f0e2d93c | 2663 | kmem_free(mapp); |
1da177e4 | 2664 | |
3605431f | 2665 | return error; |
1da177e4 LT |
2666 | } |
2667 | ||
2668 | /* | |
2669 | * Readahead the dir/attr block. | |
2670 | */ | |
2671 | xfs_daddr_t | |
2672 | xfs_da_reada_buf( | |
3605431f DC |
2673 | struct xfs_inode *dp, |
2674 | xfs_dablk_t bno, | |
da6958c8 | 2675 | xfs_daddr_t mappedbno, |
4bb20a83 | 2676 | int whichfork, |
1813dd64 | 2677 | const struct xfs_buf_ops *ops) |
1da177e4 | 2678 | { |
3605431f DC |
2679 | struct xfs_buf_map map; |
2680 | struct xfs_buf_map *mapp; | |
2681 | int nmap; | |
2682 | int error; | |
2683 | ||
2684 | mapp = ↦ | |
2685 | nmap = 1; | |
9df2dd0b | 2686 | error = xfs_dabuf_map(dp, bno, mappedbno, whichfork, |
3605431f DC |
2687 | &mapp, &nmap); |
2688 | if (error) { | |
2689 | /* mapping a hole is not an error, but we don't continue */ | |
2690 | if (error == -1) | |
2691 | error = 0; | |
2692 | goto out_free; | |
2693 | } | |
1da177e4 | 2694 | |
3605431f | 2695 | mappedbno = mapp[0].bm_bn; |
1813dd64 | 2696 | xfs_buf_readahead_map(dp->i_mount->m_ddev_targp, mapp, nmap, ops); |
3605431f DC |
2697 | |
2698 | out_free: | |
2699 | if (mapp != &map) | |
2700 | kmem_free(mapp); | |
2701 | ||
2702 | if (error) | |
1da177e4 | 2703 | return -1; |
3605431f | 2704 | return mappedbno; |
1da177e4 | 2705 | } |