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