Commit | Line | Data |
---|---|---|
1da177e4 | 1 | /* |
7b718769 | 2 | * Copyright (c) 2000-2005 Silicon Graphics, Inc. |
cbc8adf8 | 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" |
a4fbe6ab | 21 | #include "xfs_format.h" |
239880ef DC |
22 | #include "xfs_log_format.h" |
23 | #include "xfs_trans_resv.h" | |
1da177e4 | 24 | #include "xfs_sb.h" |
da353b0d | 25 | #include "xfs_ag.h" |
1da177e4 | 26 | #include "xfs_mount.h" |
57062787 | 27 | #include "xfs_da_format.h" |
a844f451 | 28 | #include "xfs_da_btree.h" |
1da177e4 LT |
29 | #include "xfs_inode.h" |
30 | #include "xfs_bmap.h" | |
2b9ab5ab | 31 | #include "xfs_dir2.h" |
57926640 | 32 | #include "xfs_dir2_priv.h" |
1da177e4 | 33 | #include "xfs_error.h" |
0b1b213f | 34 | #include "xfs_trace.h" |
239880ef | 35 | #include "xfs_trans.h" |
cbc8adf8 DC |
36 | #include "xfs_buf_item.h" |
37 | #include "xfs_cksum.h" | |
1da177e4 LT |
38 | |
39 | /* | |
40 | * Function declarations. | |
41 | */ | |
1d9025e5 DC |
42 | static int xfs_dir2_leafn_add(struct xfs_buf *bp, xfs_da_args_t *args, |
43 | int index); | |
1da177e4 LT |
44 | static void xfs_dir2_leafn_rebalance(xfs_da_state_t *state, |
45 | xfs_da_state_blk_t *blk1, | |
46 | xfs_da_state_blk_t *blk2); | |
1d9025e5 | 47 | static int xfs_dir2_leafn_remove(xfs_da_args_t *args, struct xfs_buf *bp, |
1da177e4 LT |
48 | int index, xfs_da_state_blk_t *dblk, |
49 | int *rval); | |
50 | static int xfs_dir2_node_addname_int(xfs_da_args_t *args, | |
51 | xfs_da_state_blk_t *fblk); | |
52 | ||
24df33b4 DC |
53 | /* |
54 | * Check internal consistency of a leafn block. | |
55 | */ | |
56 | #ifdef DEBUG | |
4141956a | 57 | #define xfs_dir3_leaf_check(dp, bp) \ |
24df33b4 | 58 | do { \ |
4141956a | 59 | if (!xfs_dir3_leafn_check((dp), (bp))) \ |
24df33b4 DC |
60 | ASSERT(0); \ |
61 | } while (0); | |
62 | ||
63 | static bool | |
64 | xfs_dir3_leafn_check( | |
4141956a | 65 | struct xfs_inode *dp, |
24df33b4 DC |
66 | struct xfs_buf *bp) |
67 | { | |
68 | struct xfs_dir2_leaf *leaf = bp->b_addr; | |
69 | struct xfs_dir3_icleaf_hdr leafhdr; | |
70 | ||
01ba43b8 | 71 | dp->d_ops->leaf_hdr_from_disk(&leafhdr, leaf); |
24df33b4 DC |
72 | |
73 | if (leafhdr.magic == XFS_DIR3_LEAFN_MAGIC) { | |
74 | struct xfs_dir3_leaf_hdr *leaf3 = bp->b_addr; | |
75 | if (be64_to_cpu(leaf3->info.blkno) != bp->b_bn) | |
76 | return false; | |
77 | } else if (leafhdr.magic != XFS_DIR2_LEAFN_MAGIC) | |
78 | return false; | |
79 | ||
4141956a | 80 | return xfs_dir3_leaf_check_int(dp->i_mount, dp, &leafhdr, leaf); |
24df33b4 DC |
81 | } |
82 | #else | |
4141956a | 83 | #define xfs_dir3_leaf_check(dp, bp) |
24df33b4 DC |
84 | #endif |
85 | ||
cbc8adf8 DC |
86 | static bool |
87 | xfs_dir3_free_verify( | |
2025207c DC |
88 | struct xfs_buf *bp) |
89 | { | |
90 | struct xfs_mount *mp = bp->b_target->bt_mount; | |
91 | struct xfs_dir2_free_hdr *hdr = bp->b_addr; | |
2025207c | 92 | |
cbc8adf8 DC |
93 | if (xfs_sb_version_hascrc(&mp->m_sb)) { |
94 | struct xfs_dir3_blk_hdr *hdr3 = bp->b_addr; | |
95 | ||
96 | if (hdr3->magic != cpu_to_be32(XFS_DIR3_FREE_MAGIC)) | |
97 | return false; | |
98 | if (!uuid_equal(&hdr3->uuid, &mp->m_sb.sb_uuid)) | |
99 | return false; | |
100 | if (be64_to_cpu(hdr3->blkno) != bp->b_bn) | |
101 | return false; | |
102 | } else { | |
103 | if (hdr->magic != cpu_to_be32(XFS_DIR2_FREE_MAGIC)) | |
104 | return false; | |
2025207c | 105 | } |
cbc8adf8 DC |
106 | |
107 | /* XXX: should bounds check the xfs_dir3_icfree_hdr here */ | |
108 | ||
109 | return true; | |
612cfbfe | 110 | } |
2025207c | 111 | |
612cfbfe | 112 | static void |
cbc8adf8 | 113 | xfs_dir3_free_read_verify( |
612cfbfe DC |
114 | struct xfs_buf *bp) |
115 | { | |
cbc8adf8 DC |
116 | struct xfs_mount *mp = bp->b_target->bt_mount; |
117 | ||
ce5028cf ES |
118 | if (xfs_sb_version_hascrc(&mp->m_sb) && |
119 | !xfs_buf_verify_cksum(bp, XFS_DIR3_FREE_CRC_OFF)) | |
2451337d | 120 | xfs_buf_ioerror(bp, -EFSBADCRC); |
ce5028cf | 121 | else if (!xfs_dir3_free_verify(bp)) |
2451337d | 122 | xfs_buf_ioerror(bp, -EFSCORRUPTED); |
ce5028cf ES |
123 | |
124 | if (bp->b_error) | |
125 | xfs_verifier_error(bp); | |
612cfbfe DC |
126 | } |
127 | ||
1813dd64 | 128 | static void |
cbc8adf8 | 129 | xfs_dir3_free_write_verify( |
612cfbfe DC |
130 | struct xfs_buf *bp) |
131 | { | |
cbc8adf8 DC |
132 | struct xfs_mount *mp = bp->b_target->bt_mount; |
133 | struct xfs_buf_log_item *bip = bp->b_fspriv; | |
134 | struct xfs_dir3_blk_hdr *hdr3 = bp->b_addr; | |
135 | ||
136 | if (!xfs_dir3_free_verify(bp)) { | |
2451337d | 137 | xfs_buf_ioerror(bp, -EFSCORRUPTED); |
ce5028cf | 138 | xfs_verifier_error(bp); |
cbc8adf8 DC |
139 | return; |
140 | } | |
141 | ||
142 | if (!xfs_sb_version_hascrc(&mp->m_sb)) | |
143 | return; | |
144 | ||
145 | if (bip) | |
146 | hdr3->lsn = cpu_to_be64(bip->bli_item.li_lsn); | |
147 | ||
f1dbcd7e | 148 | xfs_buf_update_cksum(bp, XFS_DIR3_FREE_CRC_OFF); |
2025207c DC |
149 | } |
150 | ||
d75afeb3 | 151 | const struct xfs_buf_ops xfs_dir3_free_buf_ops = { |
cbc8adf8 DC |
152 | .verify_read = xfs_dir3_free_read_verify, |
153 | .verify_write = xfs_dir3_free_write_verify, | |
1813dd64 DC |
154 | }; |
155 | ||
612cfbfe | 156 | |
2025207c | 157 | static int |
cbc8adf8 | 158 | __xfs_dir3_free_read( |
2025207c DC |
159 | struct xfs_trans *tp, |
160 | struct xfs_inode *dp, | |
161 | xfs_dablk_t fbno, | |
162 | xfs_daddr_t mappedbno, | |
163 | struct xfs_buf **bpp) | |
164 | { | |
d75afeb3 DC |
165 | int err; |
166 | ||
167 | err = xfs_da_read_buf(tp, dp, fbno, mappedbno, bpp, | |
cbc8adf8 | 168 | XFS_DATA_FORK, &xfs_dir3_free_buf_ops); |
d75afeb3 DC |
169 | |
170 | /* try read returns without an error or *bpp if it lands in a hole */ | |
171 | if (!err && tp && *bpp) | |
61fe135c | 172 | xfs_trans_buf_set_type(tp, *bpp, XFS_BLFT_DIR_FREE_BUF); |
d75afeb3 | 173 | return err; |
2025207c DC |
174 | } |
175 | ||
176 | int | |
177 | xfs_dir2_free_read( | |
178 | struct xfs_trans *tp, | |
179 | struct xfs_inode *dp, | |
180 | xfs_dablk_t fbno, | |
181 | struct xfs_buf **bpp) | |
182 | { | |
cbc8adf8 | 183 | return __xfs_dir3_free_read(tp, dp, fbno, -1, bpp); |
2025207c DC |
184 | } |
185 | ||
186 | static int | |
187 | xfs_dir2_free_try_read( | |
188 | struct xfs_trans *tp, | |
189 | struct xfs_inode *dp, | |
190 | xfs_dablk_t fbno, | |
191 | struct xfs_buf **bpp) | |
192 | { | |
cbc8adf8 DC |
193 | return __xfs_dir3_free_read(tp, dp, fbno, -2, bpp); |
194 | } | |
195 | ||
cbc8adf8 DC |
196 | static int |
197 | xfs_dir3_free_get_buf( | |
2998ab1d | 198 | xfs_da_args_t *args, |
cbc8adf8 DC |
199 | xfs_dir2_db_t fbno, |
200 | struct xfs_buf **bpp) | |
201 | { | |
2998ab1d DC |
202 | struct xfs_trans *tp = args->trans; |
203 | struct xfs_inode *dp = args->dp; | |
cbc8adf8 DC |
204 | struct xfs_mount *mp = dp->i_mount; |
205 | struct xfs_buf *bp; | |
206 | int error; | |
207 | struct xfs_dir3_icfree_hdr hdr; | |
208 | ||
2998ab1d | 209 | error = xfs_da_get_buf(tp, dp, xfs_dir2_db_to_da(args->geo, fbno), |
cbc8adf8 DC |
210 | -1, &bp, XFS_DATA_FORK); |
211 | if (error) | |
212 | return error; | |
213 | ||
61fe135c | 214 | xfs_trans_buf_set_type(tp, bp, XFS_BLFT_DIR_FREE_BUF); |
cbc8adf8 DC |
215 | bp->b_ops = &xfs_dir3_free_buf_ops; |
216 | ||
217 | /* | |
218 | * Initialize the new block to be empty, and remember | |
219 | * its first slot as our empty slot. | |
220 | */ | |
e400d27d DC |
221 | memset(bp->b_addr, 0, sizeof(struct xfs_dir3_free_hdr)); |
222 | memset(&hdr, 0, sizeof(hdr)); | |
223 | ||
cbc8adf8 DC |
224 | if (xfs_sb_version_hascrc(&mp->m_sb)) { |
225 | struct xfs_dir3_free_hdr *hdr3 = bp->b_addr; | |
226 | ||
227 | hdr.magic = XFS_DIR3_FREE_MAGIC; | |
e400d27d | 228 | |
cbc8adf8 DC |
229 | hdr3->hdr.blkno = cpu_to_be64(bp->b_bn); |
230 | hdr3->hdr.owner = cpu_to_be64(dp->i_ino); | |
231 | uuid_copy(&hdr3->hdr.uuid, &mp->m_sb.sb_uuid); | |
e400d27d DC |
232 | } else |
233 | hdr.magic = XFS_DIR2_FREE_MAGIC; | |
01ba43b8 | 234 | dp->d_ops->free_hdr_to_disk(bp->b_addr, &hdr); |
cbc8adf8 DC |
235 | *bpp = bp; |
236 | return 0; | |
2025207c DC |
237 | } |
238 | ||
1da177e4 LT |
239 | /* |
240 | * Log entries from a freespace block. | |
241 | */ | |
5d77c0dc | 242 | STATIC void |
1da177e4 | 243 | xfs_dir2_free_log_bests( |
bc85178a | 244 | struct xfs_da_args *args, |
1d9025e5 | 245 | struct xfs_buf *bp, |
1da177e4 LT |
246 | int first, /* first entry to log */ |
247 | int last) /* last entry to log */ | |
248 | { | |
249 | xfs_dir2_free_t *free; /* freespace structure */ | |
cbc8adf8 | 250 | __be16 *bests; |
1da177e4 | 251 | |
1d9025e5 | 252 | free = bp->b_addr; |
bc85178a | 253 | bests = args->dp->d_ops->free_bests_p(free); |
cbc8adf8 DC |
254 | ASSERT(free->hdr.magic == cpu_to_be32(XFS_DIR2_FREE_MAGIC) || |
255 | free->hdr.magic == cpu_to_be32(XFS_DIR3_FREE_MAGIC)); | |
bc85178a | 256 | xfs_trans_log_buf(args->trans, bp, |
cbc8adf8 DC |
257 | (uint)((char *)&bests[first] - (char *)free), |
258 | (uint)((char *)&bests[last] - (char *)free + | |
259 | sizeof(bests[0]) - 1)); | |
1da177e4 LT |
260 | } |
261 | ||
262 | /* | |
263 | * Log header from a freespace block. | |
264 | */ | |
265 | static void | |
266 | xfs_dir2_free_log_header( | |
bc85178a | 267 | struct xfs_da_args *args, |
1d9025e5 | 268 | struct xfs_buf *bp) |
1da177e4 | 269 | { |
836a94ad | 270 | #ifdef DEBUG |
1da177e4 LT |
271 | xfs_dir2_free_t *free; /* freespace structure */ |
272 | ||
1d9025e5 | 273 | free = bp->b_addr; |
cbc8adf8 DC |
274 | ASSERT(free->hdr.magic == cpu_to_be32(XFS_DIR2_FREE_MAGIC) || |
275 | free->hdr.magic == cpu_to_be32(XFS_DIR3_FREE_MAGIC)); | |
836a94ad | 276 | #endif |
bc85178a DC |
277 | xfs_trans_log_buf(args->trans, bp, 0, |
278 | args->dp->d_ops->free_hdr_size - 1); | |
1da177e4 LT |
279 | } |
280 | ||
281 | /* | |
282 | * Convert a leaf-format directory to a node-format directory. | |
283 | * We need to change the magic number of the leaf block, and copy | |
284 | * the freespace table out of the leaf block into its own block. | |
285 | */ | |
286 | int /* error */ | |
287 | xfs_dir2_leaf_to_node( | |
288 | xfs_da_args_t *args, /* operation arguments */ | |
1d9025e5 | 289 | struct xfs_buf *lbp) /* leaf buffer */ |
1da177e4 LT |
290 | { |
291 | xfs_inode_t *dp; /* incore directory inode */ | |
292 | int error; /* error return value */ | |
1d9025e5 | 293 | struct xfs_buf *fbp; /* freespace buffer */ |
1da177e4 LT |
294 | xfs_dir2_db_t fdb; /* freespace block number */ |
295 | xfs_dir2_free_t *free; /* freespace structure */ | |
68b3a102 | 296 | __be16 *from; /* pointer to freespace entry */ |
1da177e4 LT |
297 | int i; /* leaf freespace index */ |
298 | xfs_dir2_leaf_t *leaf; /* leaf structure */ | |
299 | xfs_dir2_leaf_tail_t *ltp; /* leaf tail structure */ | |
300 | xfs_mount_t *mp; /* filesystem mount point */ | |
301 | int n; /* count of live freespc ents */ | |
302 | xfs_dir2_data_off_t off; /* freespace entry value */ | |
0ba962ef | 303 | __be16 *to; /* pointer to freespace entry */ |
1da177e4 | 304 | xfs_trans_t *tp; /* transaction pointer */ |
cbc8adf8 | 305 | struct xfs_dir3_icfree_hdr freehdr; |
1da177e4 | 306 | |
0b1b213f CH |
307 | trace_xfs_dir2_leaf_to_node(args); |
308 | ||
1da177e4 LT |
309 | dp = args->dp; |
310 | mp = dp->i_mount; | |
311 | tp = args->trans; | |
312 | /* | |
313 | * Add a freespace block to the directory. | |
314 | */ | |
315 | if ((error = xfs_dir2_grow_inode(args, XFS_DIR2_FREE_SPACE, &fdb))) { | |
316 | return error; | |
317 | } | |
30028030 | 318 | ASSERT(fdb == xfs_dir2_byte_to_db(args->geo, XFS_DIR2_FREE_OFFSET)); |
1da177e4 LT |
319 | /* |
320 | * Get the buffer for the new freespace block. | |
321 | */ | |
2998ab1d | 322 | error = xfs_dir3_free_get_buf(args, fdb, &fbp); |
b0f539de | 323 | if (error) |
1da177e4 | 324 | return error; |
b0f539de | 325 | |
1d9025e5 | 326 | free = fbp->b_addr; |
01ba43b8 | 327 | dp->d_ops->free_hdr_from_disk(&freehdr, free); |
1d9025e5 | 328 | leaf = lbp->b_addr; |
8f66193c | 329 | ltp = xfs_dir2_leaf_tail_p(args->geo, leaf); |
cbc8adf8 | 330 | ASSERT(be32_to_cpu(ltp->bestcount) <= |
8f66193c | 331 | (uint)dp->i_d.di_size / args->geo->blksize); |
cbc8adf8 | 332 | |
1da177e4 LT |
333 | /* |
334 | * Copy freespace entries from the leaf block to the new block. | |
335 | * Count active entries. | |
336 | */ | |
cbc8adf8 | 337 | from = xfs_dir2_leaf_bests_p(ltp); |
24dd0f54 | 338 | to = dp->d_ops->free_bests_p(free); |
cbc8adf8 | 339 | for (i = n = 0; i < be32_to_cpu(ltp->bestcount); i++, from++, to++) { |
68b3a102 | 340 | if ((off = be16_to_cpu(*from)) != NULLDATAOFF) |
1da177e4 | 341 | n++; |
0ba962ef | 342 | *to = cpu_to_be16(off); |
1da177e4 | 343 | } |
b0f539de | 344 | |
1da177e4 | 345 | /* |
cbc8adf8 | 346 | * Now initialize the freespace block header. |
1da177e4 | 347 | */ |
cbc8adf8 DC |
348 | freehdr.nused = n; |
349 | freehdr.nvalid = be32_to_cpu(ltp->bestcount); | |
350 | ||
01ba43b8 | 351 | dp->d_ops->free_hdr_to_disk(fbp->b_addr, &freehdr); |
bc85178a DC |
352 | xfs_dir2_free_log_bests(args, fbp, 0, freehdr.nvalid - 1); |
353 | xfs_dir2_free_log_header(args, fbp); | |
cbc8adf8 | 354 | |
24df33b4 DC |
355 | /* |
356 | * Converting the leaf to a leafnode is just a matter of changing the | |
357 | * magic number and the ops. Do the change directly to the buffer as | |
358 | * it's less work (and less code) than decoding the header to host | |
359 | * format and back again. | |
360 | */ | |
361 | if (leaf->hdr.info.magic == cpu_to_be16(XFS_DIR2_LEAF1_MAGIC)) | |
362 | leaf->hdr.info.magic = cpu_to_be16(XFS_DIR2_LEAFN_MAGIC); | |
363 | else | |
364 | leaf->hdr.info.magic = cpu_to_be16(XFS_DIR3_LEAFN_MAGIC); | |
365 | lbp->b_ops = &xfs_dir3_leafn_buf_ops; | |
61fe135c | 366 | xfs_trans_buf_set_type(tp, lbp, XFS_BLFT_DIR_LEAFN_BUF); |
bc85178a | 367 | xfs_dir3_leaf_log_header(args, lbp); |
4141956a | 368 | xfs_dir3_leaf_check(dp, lbp); |
1da177e4 LT |
369 | return 0; |
370 | } | |
371 | ||
372 | /* | |
373 | * Add a leaf entry to a leaf block in a node-form directory. | |
374 | * The other work necessary is done from the caller. | |
375 | */ | |
376 | static int /* error */ | |
377 | xfs_dir2_leafn_add( | |
1d9025e5 | 378 | struct xfs_buf *bp, /* leaf buffer */ |
1da177e4 LT |
379 | xfs_da_args_t *args, /* operation arguments */ |
380 | int index) /* insertion pt for new entry */ | |
381 | { | |
382 | int compact; /* compacting stale leaves */ | |
383 | xfs_inode_t *dp; /* incore directory inode */ | |
384 | int highstale; /* next stale entry */ | |
385 | xfs_dir2_leaf_t *leaf; /* leaf structure */ | |
386 | xfs_dir2_leaf_entry_t *lep; /* leaf entry */ | |
387 | int lfloghigh; /* high leaf entry logging */ | |
388 | int lfloglow; /* low leaf entry logging */ | |
389 | int lowstale; /* previous stale entry */ | |
390 | xfs_mount_t *mp; /* filesystem mount point */ | |
391 | xfs_trans_t *tp; /* transaction pointer */ | |
24df33b4 DC |
392 | struct xfs_dir3_icleaf_hdr leafhdr; |
393 | struct xfs_dir2_leaf_entry *ents; | |
1da177e4 | 394 | |
0b1b213f CH |
395 | trace_xfs_dir2_leafn_add(args, index); |
396 | ||
1da177e4 LT |
397 | dp = args->dp; |
398 | mp = dp->i_mount; | |
399 | tp = args->trans; | |
1d9025e5 | 400 | leaf = bp->b_addr; |
01ba43b8 | 401 | dp->d_ops->leaf_hdr_from_disk(&leafhdr, leaf); |
4141956a | 402 | ents = dp->d_ops->leaf_ents_p(leaf); |
1da177e4 LT |
403 | |
404 | /* | |
405 | * Quick check just to make sure we are not going to index | |
406 | * into other peoples memory | |
407 | */ | |
408 | if (index < 0) | |
2451337d | 409 | return -EFSCORRUPTED; |
1da177e4 LT |
410 | |
411 | /* | |
412 | * If there are already the maximum number of leaf entries in | |
413 | * the block, if there are no stale entries it won't fit. | |
414 | * Caller will do a split. If there are stale entries we'll do | |
415 | * a compact. | |
416 | */ | |
417 | ||
8f66193c | 418 | if (leafhdr.count == dp->d_ops->leaf_max_ents(args->geo)) { |
24df33b4 | 419 | if (!leafhdr.stale) |
2451337d | 420 | return -ENOSPC; |
24df33b4 | 421 | compact = leafhdr.stale > 1; |
1da177e4 LT |
422 | } else |
423 | compact = 0; | |
24df33b4 DC |
424 | ASSERT(index == 0 || be32_to_cpu(ents[index - 1].hashval) <= args->hashval); |
425 | ASSERT(index == leafhdr.count || | |
426 | be32_to_cpu(ents[index].hashval) >= args->hashval); | |
1da177e4 | 427 | |
6a178100 | 428 | if (args->op_flags & XFS_DA_OP_JUSTCHECK) |
1da177e4 LT |
429 | return 0; |
430 | ||
431 | /* | |
432 | * Compact out all but one stale leaf entry. Leaves behind | |
433 | * the entry closest to index. | |
434 | */ | |
24df33b4 DC |
435 | if (compact) |
436 | xfs_dir3_leaf_compact_x1(&leafhdr, ents, &index, &lowstale, | |
437 | &highstale, &lfloglow, &lfloghigh); | |
438 | else if (leafhdr.stale) { | |
439 | /* | |
440 | * Set impossible logging indices for this case. | |
441 | */ | |
442 | lfloglow = leafhdr.count; | |
1da177e4 LT |
443 | lfloghigh = -1; |
444 | } | |
4fb44c82 | 445 | |
1da177e4 LT |
446 | /* |
447 | * Insert the new entry, log everything. | |
448 | */ | |
24df33b4 | 449 | lep = xfs_dir3_leaf_find_entry(&leafhdr, ents, index, compact, lowstale, |
4fb44c82 CH |
450 | highstale, &lfloglow, &lfloghigh); |
451 | ||
3c1f9c15 | 452 | lep->hashval = cpu_to_be32(args->hashval); |
30028030 | 453 | lep->address = cpu_to_be32(xfs_dir2_db_off_to_dataptr(args->geo, |
3c1f9c15 | 454 | args->blkno, args->index)); |
24df33b4 | 455 | |
01ba43b8 | 456 | dp->d_ops->leaf_hdr_to_disk(leaf, &leafhdr); |
bc85178a DC |
457 | xfs_dir3_leaf_log_header(args, bp); |
458 | xfs_dir3_leaf_log_ents(args, bp, lfloglow, lfloghigh); | |
4141956a | 459 | xfs_dir3_leaf_check(dp, bp); |
1da177e4 LT |
460 | return 0; |
461 | } | |
462 | ||
463 | #ifdef DEBUG | |
cbc8adf8 DC |
464 | static void |
465 | xfs_dir2_free_hdr_check( | |
01ba43b8 | 466 | struct xfs_inode *dp, |
cbc8adf8 DC |
467 | struct xfs_buf *bp, |
468 | xfs_dir2_db_t db) | |
469 | { | |
470 | struct xfs_dir3_icfree_hdr hdr; | |
471 | ||
01ba43b8 | 472 | dp->d_ops->free_hdr_from_disk(&hdr, bp->b_addr); |
cbc8adf8 | 473 | |
8f66193c DC |
474 | ASSERT((hdr.firstdb % |
475 | dp->d_ops->free_max_bests(dp->i_mount->m_dir_geo)) == 0); | |
cbc8adf8 DC |
476 | ASSERT(hdr.firstdb <= db); |
477 | ASSERT(db < hdr.firstdb + hdr.nvalid); | |
478 | } | |
479 | #else | |
01ba43b8 | 480 | #define xfs_dir2_free_hdr_check(dp, bp, db) |
1da177e4 LT |
481 | #endif /* DEBUG */ |
482 | ||
483 | /* | |
484 | * Return the last hash value in the leaf. | |
485 | * Stale entries are ok. | |
486 | */ | |
487 | xfs_dahash_t /* hash value */ | |
488 | xfs_dir2_leafn_lasthash( | |
4141956a | 489 | struct xfs_inode *dp, |
1d9025e5 | 490 | struct xfs_buf *bp, /* leaf buffer */ |
1da177e4 LT |
491 | int *count) /* count of entries in leaf */ |
492 | { | |
24df33b4 DC |
493 | struct xfs_dir2_leaf *leaf = bp->b_addr; |
494 | struct xfs_dir2_leaf_entry *ents; | |
495 | struct xfs_dir3_icleaf_hdr leafhdr; | |
496 | ||
01ba43b8 | 497 | dp->d_ops->leaf_hdr_from_disk(&leafhdr, leaf); |
24df33b4 DC |
498 | |
499 | ASSERT(leafhdr.magic == XFS_DIR2_LEAFN_MAGIC || | |
500 | leafhdr.magic == XFS_DIR3_LEAFN_MAGIC); | |
1da177e4 | 501 | |
1da177e4 | 502 | if (count) |
24df33b4 DC |
503 | *count = leafhdr.count; |
504 | if (!leafhdr.count) | |
1da177e4 | 505 | return 0; |
24df33b4 | 506 | |
4141956a | 507 | ents = dp->d_ops->leaf_ents_p(leaf); |
24df33b4 | 508 | return be32_to_cpu(ents[leafhdr.count - 1].hashval); |
1da177e4 LT |
509 | } |
510 | ||
511 | /* | |
f9f6dce0 BN |
512 | * Look up a leaf entry for space to add a name in a node-format leaf block. |
513 | * The extrablk in state is a freespace block. | |
1da177e4 | 514 | */ |
f9f6dce0 BN |
515 | STATIC int |
516 | xfs_dir2_leafn_lookup_for_addname( | |
1d9025e5 | 517 | struct xfs_buf *bp, /* leaf buffer */ |
1da177e4 LT |
518 | xfs_da_args_t *args, /* operation arguments */ |
519 | int *indexp, /* out: leaf entry index */ | |
520 | xfs_da_state_t *state) /* state to fill in */ | |
521 | { | |
1d9025e5 | 522 | struct xfs_buf *curbp = NULL; /* current data/free buffer */ |
f9f6dce0 BN |
523 | xfs_dir2_db_t curdb = -1; /* current data block number */ |
524 | xfs_dir2_db_t curfdb = -1; /* current free block number */ | |
1da177e4 LT |
525 | xfs_inode_t *dp; /* incore directory inode */ |
526 | int error; /* error return value */ | |
527 | int fi; /* free entry index */ | |
f9f6dce0 | 528 | xfs_dir2_free_t *free = NULL; /* free block structure */ |
1da177e4 LT |
529 | int index; /* leaf entry index */ |
530 | xfs_dir2_leaf_t *leaf; /* leaf structure */ | |
f9f6dce0 | 531 | int length; /* length of new data entry */ |
1da177e4 LT |
532 | xfs_dir2_leaf_entry_t *lep; /* leaf entry */ |
533 | xfs_mount_t *mp; /* filesystem mount point */ | |
534 | xfs_dir2_db_t newdb; /* new data block number */ | |
535 | xfs_dir2_db_t newfdb; /* new free block number */ | |
536 | xfs_trans_t *tp; /* transaction pointer */ | |
24df33b4 DC |
537 | struct xfs_dir2_leaf_entry *ents; |
538 | struct xfs_dir3_icleaf_hdr leafhdr; | |
1da177e4 LT |
539 | |
540 | dp = args->dp; | |
541 | tp = args->trans; | |
542 | mp = dp->i_mount; | |
1d9025e5 | 543 | leaf = bp->b_addr; |
01ba43b8 | 544 | dp->d_ops->leaf_hdr_from_disk(&leafhdr, leaf); |
4141956a | 545 | ents = dp->d_ops->leaf_ents_p(leaf); |
24df33b4 | 546 | |
4141956a | 547 | xfs_dir3_leaf_check(dp, bp); |
24df33b4 DC |
548 | ASSERT(leafhdr.count > 0); |
549 | ||
1da177e4 LT |
550 | /* |
551 | * Look up the hash value in the leaf entries. | |
552 | */ | |
553 | index = xfs_dir2_leaf_search_hash(args, bp); | |
554 | /* | |
555 | * Do we have a buffer coming in? | |
556 | */ | |
f9f6dce0 BN |
557 | if (state->extravalid) { |
558 | /* If so, it's a free block buffer, get the block number. */ | |
1da177e4 | 559 | curbp = state->extrablk.bp; |
f9f6dce0 | 560 | curfdb = state->extrablk.blkno; |
1d9025e5 | 561 | free = curbp->b_addr; |
cbc8adf8 DC |
562 | ASSERT(free->hdr.magic == cpu_to_be32(XFS_DIR2_FREE_MAGIC) || |
563 | free->hdr.magic == cpu_to_be32(XFS_DIR3_FREE_MAGIC)); | |
1da177e4 | 564 | } |
9d23fc85 | 565 | length = dp->d_ops->data_entsize(args->namelen); |
1da177e4 LT |
566 | /* |
567 | * Loop over leaf entries with the right hash value. | |
568 | */ | |
24df33b4 DC |
569 | for (lep = &ents[index]; |
570 | index < leafhdr.count && be32_to_cpu(lep->hashval) == args->hashval; | |
571 | lep++, index++) { | |
1da177e4 LT |
572 | /* |
573 | * Skip stale leaf entries. | |
574 | */ | |
3c1f9c15 | 575 | if (be32_to_cpu(lep->address) == XFS_DIR2_NULL_DATAPTR) |
1da177e4 LT |
576 | continue; |
577 | /* | |
578 | * Pull the data block number from the entry. | |
579 | */ | |
30028030 DC |
580 | newdb = xfs_dir2_dataptr_to_db(args->geo, |
581 | be32_to_cpu(lep->address)); | |
1da177e4 LT |
582 | /* |
583 | * For addname, we're looking for a place to put the new entry. | |
584 | * We want to use a data block with an entry of equal | |
585 | * hash value to ours if there is one with room. | |
f9f6dce0 BN |
586 | * |
587 | * If this block isn't the data block we already have | |
588 | * in hand, take a look at it. | |
1da177e4 | 589 | */ |
f9f6dce0 | 590 | if (newdb != curdb) { |
cbc8adf8 DC |
591 | __be16 *bests; |
592 | ||
f9f6dce0 | 593 | curdb = newdb; |
1da177e4 | 594 | /* |
f9f6dce0 BN |
595 | * Convert the data block to the free block |
596 | * holding its freespace information. | |
1da177e4 | 597 | */ |
8f66193c | 598 | newfdb = dp->d_ops->db_to_fdb(args->geo, newdb); |
1da177e4 | 599 | /* |
f9f6dce0 | 600 | * If it's not the one we have in hand, read it in. |
1da177e4 | 601 | */ |
f9f6dce0 | 602 | if (newfdb != curfdb) { |
1da177e4 | 603 | /* |
f9f6dce0 | 604 | * If we had one before, drop it. |
1da177e4 LT |
605 | */ |
606 | if (curbp) | |
1d9025e5 | 607 | xfs_trans_brelse(tp, curbp); |
2025207c DC |
608 | |
609 | error = xfs_dir2_free_read(tp, dp, | |
2998ab1d DC |
610 | xfs_dir2_db_to_da(args->geo, |
611 | newfdb), | |
2025207c | 612 | &curbp); |
f9f6dce0 | 613 | if (error) |
1da177e4 | 614 | return error; |
1d9025e5 | 615 | free = curbp->b_addr; |
cbc8adf8 | 616 | |
01ba43b8 | 617 | xfs_dir2_free_hdr_check(dp, curbp, curdb); |
1da177e4 LT |
618 | } |
619 | /* | |
f9f6dce0 | 620 | * Get the index for our entry. |
1da177e4 | 621 | */ |
8f66193c | 622 | fi = dp->d_ops->db_to_fdindex(args->geo, curdb); |
1da177e4 | 623 | /* |
f9f6dce0 | 624 | * If it has room, return it. |
1da177e4 | 625 | */ |
24dd0f54 | 626 | bests = dp->d_ops->free_bests_p(free); |
cbc8adf8 | 627 | if (unlikely(bests[fi] == cpu_to_be16(NULLDATAOFF))) { |
f9f6dce0 BN |
628 | XFS_ERROR_REPORT("xfs_dir2_leafn_lookup_int", |
629 | XFS_ERRLEVEL_LOW, mp); | |
630 | if (curfdb != newfdb) | |
1d9025e5 | 631 | xfs_trans_brelse(tp, curbp); |
2451337d | 632 | return -EFSCORRUPTED; |
1da177e4 | 633 | } |
f9f6dce0 | 634 | curfdb = newfdb; |
cbc8adf8 | 635 | if (be16_to_cpu(bests[fi]) >= length) |
f9f6dce0 | 636 | goto out; |
1da177e4 LT |
637 | } |
638 | } | |
f9f6dce0 BN |
639 | /* Didn't find any space */ |
640 | fi = -1; | |
641 | out: | |
6a178100 | 642 | ASSERT(args->op_flags & XFS_DA_OP_OKNOENT); |
f9f6dce0 BN |
643 | if (curbp) { |
644 | /* Giving back a free block. */ | |
645 | state->extravalid = 1; | |
646 | state->extrablk.bp = curbp; | |
647 | state->extrablk.index = fi; | |
648 | state->extrablk.blkno = curfdb; | |
cbc8adf8 DC |
649 | |
650 | /* | |
651 | * Important: this magic number is not in the buffer - it's for | |
652 | * buffer type information and therefore only the free/data type | |
653 | * matters here, not whether CRCs are enabled or not. | |
654 | */ | |
f9f6dce0 BN |
655 | state->extrablk.magic = XFS_DIR2_FREE_MAGIC; |
656 | } else { | |
657 | state->extravalid = 0; | |
658 | } | |
1da177e4 | 659 | /* |
f9f6dce0 | 660 | * Return the index, that will be the insertion point. |
1da177e4 | 661 | */ |
f9f6dce0 | 662 | *indexp = index; |
2451337d | 663 | return -ENOENT; |
f9f6dce0 BN |
664 | } |
665 | ||
666 | /* | |
667 | * Look up a leaf entry in a node-format leaf block. | |
668 | * The extrablk in state a data block. | |
669 | */ | |
670 | STATIC int | |
671 | xfs_dir2_leafn_lookup_for_entry( | |
1d9025e5 | 672 | struct xfs_buf *bp, /* leaf buffer */ |
f9f6dce0 BN |
673 | xfs_da_args_t *args, /* operation arguments */ |
674 | int *indexp, /* out: leaf entry index */ | |
675 | xfs_da_state_t *state) /* state to fill in */ | |
676 | { | |
1d9025e5 | 677 | struct xfs_buf *curbp = NULL; /* current data/free buffer */ |
f9f6dce0 BN |
678 | xfs_dir2_db_t curdb = -1; /* current data block number */ |
679 | xfs_dir2_data_entry_t *dep; /* data block entry */ | |
680 | xfs_inode_t *dp; /* incore directory inode */ | |
681 | int error; /* error return value */ | |
f9f6dce0 BN |
682 | int index; /* leaf entry index */ |
683 | xfs_dir2_leaf_t *leaf; /* leaf structure */ | |
684 | xfs_dir2_leaf_entry_t *lep; /* leaf entry */ | |
685 | xfs_mount_t *mp; /* filesystem mount point */ | |
686 | xfs_dir2_db_t newdb; /* new data block number */ | |
687 | xfs_trans_t *tp; /* transaction pointer */ | |
5163f95a | 688 | enum xfs_dacmp cmp; /* comparison result */ |
24df33b4 DC |
689 | struct xfs_dir2_leaf_entry *ents; |
690 | struct xfs_dir3_icleaf_hdr leafhdr; | |
f9f6dce0 BN |
691 | |
692 | dp = args->dp; | |
693 | tp = args->trans; | |
694 | mp = dp->i_mount; | |
1d9025e5 | 695 | leaf = bp->b_addr; |
01ba43b8 | 696 | dp->d_ops->leaf_hdr_from_disk(&leafhdr, leaf); |
4141956a | 697 | ents = dp->d_ops->leaf_ents_p(leaf); |
24df33b4 | 698 | |
4141956a | 699 | xfs_dir3_leaf_check(dp, bp); |
24df33b4 DC |
700 | ASSERT(leafhdr.count > 0); |
701 | ||
f9f6dce0 BN |
702 | /* |
703 | * Look up the hash value in the leaf entries. | |
704 | */ | |
705 | index = xfs_dir2_leaf_search_hash(args, bp); | |
706 | /* | |
707 | * Do we have a buffer coming in? | |
708 | */ | |
709 | if (state->extravalid) { | |
710 | curbp = state->extrablk.bp; | |
711 | curdb = state->extrablk.blkno; | |
712 | } | |
713 | /* | |
714 | * Loop over leaf entries with the right hash value. | |
715 | */ | |
24df33b4 DC |
716 | for (lep = &ents[index]; |
717 | index < leafhdr.count && be32_to_cpu(lep->hashval) == args->hashval; | |
718 | lep++, index++) { | |
f9f6dce0 BN |
719 | /* |
720 | * Skip stale leaf entries. | |
721 | */ | |
722 | if (be32_to_cpu(lep->address) == XFS_DIR2_NULL_DATAPTR) | |
723 | continue; | |
1da177e4 | 724 | /* |
f9f6dce0 BN |
725 | * Pull the data block number from the entry. |
726 | */ | |
30028030 DC |
727 | newdb = xfs_dir2_dataptr_to_db(args->geo, |
728 | be32_to_cpu(lep->address)); | |
f9f6dce0 BN |
729 | /* |
730 | * Not adding a new entry, so we really want to find | |
731 | * the name given to us. | |
732 | * | |
733 | * If it's a different data block, go get it. | |
1da177e4 | 734 | */ |
f9f6dce0 BN |
735 | if (newdb != curdb) { |
736 | /* | |
90bb7ab0 BN |
737 | * If we had a block before that we aren't saving |
738 | * for a CI name, drop it | |
f9f6dce0 | 739 | */ |
90bb7ab0 BN |
740 | if (curbp && (args->cmpresult == XFS_CMP_DIFFERENT || |
741 | curdb != state->extrablk.blkno)) | |
1d9025e5 | 742 | xfs_trans_brelse(tp, curbp); |
f9f6dce0 | 743 | /* |
90bb7ab0 BN |
744 | * If needing the block that is saved with a CI match, |
745 | * use it otherwise read in the new data block. | |
f9f6dce0 | 746 | */ |
90bb7ab0 BN |
747 | if (args->cmpresult != XFS_CMP_DIFFERENT && |
748 | newdb == state->extrablk.blkno) { | |
749 | ASSERT(state->extravalid); | |
750 | curbp = state->extrablk.bp; | |
751 | } else { | |
33363fee | 752 | error = xfs_dir3_data_read(tp, dp, |
2998ab1d DC |
753 | xfs_dir2_db_to_da(args->geo, |
754 | newdb), | |
e4813572 | 755 | -1, &curbp); |
90bb7ab0 BN |
756 | if (error) |
757 | return error; | |
758 | } | |
33363fee | 759 | xfs_dir3_data_check(dp, curbp); |
f9f6dce0 | 760 | curdb = newdb; |
1da177e4 LT |
761 | } |
762 | /* | |
f9f6dce0 | 763 | * Point to the data entry. |
1da177e4 | 764 | */ |
1d9025e5 | 765 | dep = (xfs_dir2_data_entry_t *)((char *)curbp->b_addr + |
30028030 DC |
766 | xfs_dir2_dataptr_to_off(args->geo, |
767 | be32_to_cpu(lep->address))); | |
f9f6dce0 | 768 | /* |
5163f95a BN |
769 | * Compare the entry and if it's an exact match, return |
770 | * EEXIST immediately. If it's the first case-insensitive | |
90bb7ab0 | 771 | * match, store the block & inode number and continue looking. |
f9f6dce0 | 772 | */ |
5163f95a BN |
773 | cmp = mp->m_dirnameops->compname(args, dep->name, dep->namelen); |
774 | if (cmp != XFS_CMP_DIFFERENT && cmp != args->cmpresult) { | |
90bb7ab0 BN |
775 | /* If there is a CI match block, drop it */ |
776 | if (args->cmpresult != XFS_CMP_DIFFERENT && | |
777 | curdb != state->extrablk.blkno) | |
1d9025e5 | 778 | xfs_trans_brelse(tp, state->extrablk.bp); |
5163f95a | 779 | args->cmpresult = cmp; |
f9f6dce0 | 780 | args->inumber = be64_to_cpu(dep->inumber); |
9d23fc85 | 781 | args->filetype = dp->d_ops->data_get_ftype(dep); |
90bb7ab0 BN |
782 | *indexp = index; |
783 | state->extravalid = 1; | |
784 | state->extrablk.bp = curbp; | |
785 | state->extrablk.blkno = curdb; | |
786 | state->extrablk.index = (int)((char *)dep - | |
1d9025e5 | 787 | (char *)curbp->b_addr); |
90bb7ab0 | 788 | state->extrablk.magic = XFS_DIR2_DATA_MAGIC; |
33363fee | 789 | curbp->b_ops = &xfs_dir3_data_buf_ops; |
61fe135c | 790 | xfs_trans_buf_set_type(tp, curbp, XFS_BLFT_DIR_DATA_BUF); |
5163f95a | 791 | if (cmp == XFS_CMP_EXACT) |
2451337d | 792 | return -EEXIST; |
1da177e4 LT |
793 | } |
794 | } | |
24df33b4 | 795 | ASSERT(index == leafhdr.count || (args->op_flags & XFS_DA_OP_OKNOENT)); |
f9f6dce0 | 796 | if (curbp) { |
90bb7ab0 BN |
797 | if (args->cmpresult == XFS_CMP_DIFFERENT) { |
798 | /* Giving back last used data block. */ | |
799 | state->extravalid = 1; | |
800 | state->extrablk.bp = curbp; | |
801 | state->extrablk.index = -1; | |
802 | state->extrablk.blkno = curdb; | |
803 | state->extrablk.magic = XFS_DIR2_DATA_MAGIC; | |
33363fee | 804 | curbp->b_ops = &xfs_dir3_data_buf_ops; |
61fe135c | 805 | xfs_trans_buf_set_type(tp, curbp, XFS_BLFT_DIR_DATA_BUF); |
90bb7ab0 BN |
806 | } else { |
807 | /* If the curbp is not the CI match block, drop it */ | |
808 | if (state->extrablk.bp != curbp) | |
1d9025e5 | 809 | xfs_trans_brelse(tp, curbp); |
90bb7ab0 | 810 | } |
f9f6dce0 BN |
811 | } else { |
812 | state->extravalid = 0; | |
813 | } | |
1da177e4 | 814 | *indexp = index; |
2451337d | 815 | return -ENOENT; |
f9f6dce0 BN |
816 | } |
817 | ||
818 | /* | |
819 | * Look up a leaf entry in a node-format leaf block. | |
820 | * If this is an addname then the extrablk in state is a freespace block, | |
821 | * otherwise it's a data block. | |
822 | */ | |
823 | int | |
824 | xfs_dir2_leafn_lookup_int( | |
1d9025e5 | 825 | struct xfs_buf *bp, /* leaf buffer */ |
f9f6dce0 BN |
826 | xfs_da_args_t *args, /* operation arguments */ |
827 | int *indexp, /* out: leaf entry index */ | |
828 | xfs_da_state_t *state) /* state to fill in */ | |
829 | { | |
6a178100 | 830 | if (args->op_flags & XFS_DA_OP_ADDNAME) |
f9f6dce0 BN |
831 | return xfs_dir2_leafn_lookup_for_addname(bp, args, indexp, |
832 | state); | |
833 | return xfs_dir2_leafn_lookup_for_entry(bp, args, indexp, state); | |
1da177e4 LT |
834 | } |
835 | ||
836 | /* | |
837 | * Move count leaf entries from source to destination leaf. | |
838 | * Log entries and headers. Stale entries are preserved. | |
839 | */ | |
840 | static void | |
24df33b4 DC |
841 | xfs_dir3_leafn_moveents( |
842 | xfs_da_args_t *args, /* operation arguments */ | |
843 | struct xfs_buf *bp_s, /* source */ | |
844 | struct xfs_dir3_icleaf_hdr *shdr, | |
845 | struct xfs_dir2_leaf_entry *sents, | |
846 | int start_s,/* source leaf index */ | |
847 | struct xfs_buf *bp_d, /* destination */ | |
848 | struct xfs_dir3_icleaf_hdr *dhdr, | |
849 | struct xfs_dir2_leaf_entry *dents, | |
850 | int start_d,/* destination leaf index */ | |
851 | int count) /* count of leaves to copy */ | |
1da177e4 | 852 | { |
24df33b4 | 853 | int stale; /* count stale leaves copied */ |
1da177e4 | 854 | |
0b1b213f CH |
855 | trace_xfs_dir2_leafn_moveents(args, start_s, start_d, count); |
856 | ||
1da177e4 LT |
857 | /* |
858 | * Silently return if nothing to do. | |
859 | */ | |
24df33b4 | 860 | if (count == 0) |
1da177e4 | 861 | return; |
24df33b4 | 862 | |
1da177e4 LT |
863 | /* |
864 | * If the destination index is not the end of the current | |
865 | * destination leaf entries, open up a hole in the destination | |
866 | * to hold the new entries. | |
867 | */ | |
24df33b4 DC |
868 | if (start_d < dhdr->count) { |
869 | memmove(&dents[start_d + count], &dents[start_d], | |
870 | (dhdr->count - start_d) * sizeof(xfs_dir2_leaf_entry_t)); | |
bc85178a | 871 | xfs_dir3_leaf_log_ents(args, bp_d, start_d + count, |
24df33b4 | 872 | count + dhdr->count - 1); |
1da177e4 LT |
873 | } |
874 | /* | |
875 | * If the source has stale leaves, count the ones in the copy range | |
876 | * so we can update the header correctly. | |
877 | */ | |
24df33b4 | 878 | if (shdr->stale) { |
1da177e4 LT |
879 | int i; /* temp leaf index */ |
880 | ||
881 | for (i = start_s, stale = 0; i < start_s + count; i++) { | |
24df33b4 DC |
882 | if (sents[i].address == |
883 | cpu_to_be32(XFS_DIR2_NULL_DATAPTR)) | |
1da177e4 LT |
884 | stale++; |
885 | } | |
886 | } else | |
887 | stale = 0; | |
888 | /* | |
889 | * Copy the leaf entries from source to destination. | |
890 | */ | |
24df33b4 | 891 | memcpy(&dents[start_d], &sents[start_s], |
1da177e4 | 892 | count * sizeof(xfs_dir2_leaf_entry_t)); |
bc85178a | 893 | xfs_dir3_leaf_log_ents(args, bp_d, start_d, start_d + count - 1); |
24df33b4 | 894 | |
1da177e4 LT |
895 | /* |
896 | * If there are source entries after the ones we copied, | |
897 | * delete the ones we copied by sliding the next ones down. | |
898 | */ | |
24df33b4 DC |
899 | if (start_s + count < shdr->count) { |
900 | memmove(&sents[start_s], &sents[start_s + count], | |
1da177e4 | 901 | count * sizeof(xfs_dir2_leaf_entry_t)); |
bc85178a | 902 | xfs_dir3_leaf_log_ents(args, bp_s, start_s, start_s + count - 1); |
1da177e4 | 903 | } |
24df33b4 | 904 | |
1da177e4 LT |
905 | /* |
906 | * Update the headers and log them. | |
907 | */ | |
24df33b4 DC |
908 | shdr->count -= count; |
909 | shdr->stale -= stale; | |
910 | dhdr->count += count; | |
911 | dhdr->stale += stale; | |
1da177e4 LT |
912 | } |
913 | ||
914 | /* | |
915 | * Determine the sort order of two leaf blocks. | |
916 | * Returns 1 if both are valid and leaf2 should be before leaf1, else 0. | |
917 | */ | |
918 | int /* sort order */ | |
919 | xfs_dir2_leafn_order( | |
4141956a | 920 | struct xfs_inode *dp, |
24df33b4 DC |
921 | struct xfs_buf *leaf1_bp, /* leaf1 buffer */ |
922 | struct xfs_buf *leaf2_bp) /* leaf2 buffer */ | |
1da177e4 | 923 | { |
24df33b4 DC |
924 | struct xfs_dir2_leaf *leaf1 = leaf1_bp->b_addr; |
925 | struct xfs_dir2_leaf *leaf2 = leaf2_bp->b_addr; | |
926 | struct xfs_dir2_leaf_entry *ents1; | |
927 | struct xfs_dir2_leaf_entry *ents2; | |
928 | struct xfs_dir3_icleaf_hdr hdr1; | |
929 | struct xfs_dir3_icleaf_hdr hdr2; | |
930 | ||
01ba43b8 DC |
931 | dp->d_ops->leaf_hdr_from_disk(&hdr1, leaf1); |
932 | dp->d_ops->leaf_hdr_from_disk(&hdr2, leaf2); | |
4141956a DC |
933 | ents1 = dp->d_ops->leaf_ents_p(leaf1); |
934 | ents2 = dp->d_ops->leaf_ents_p(leaf2); | |
24df33b4 DC |
935 | |
936 | if (hdr1.count > 0 && hdr2.count > 0 && | |
937 | (be32_to_cpu(ents2[0].hashval) < be32_to_cpu(ents1[0].hashval) || | |
938 | be32_to_cpu(ents2[hdr2.count - 1].hashval) < | |
939 | be32_to_cpu(ents1[hdr1.count - 1].hashval))) | |
1da177e4 LT |
940 | return 1; |
941 | return 0; | |
942 | } | |
943 | ||
944 | /* | |
945 | * Rebalance leaf entries between two leaf blocks. | |
946 | * This is actually only called when the second block is new, | |
947 | * though the code deals with the general case. | |
948 | * A new entry will be inserted in one of the blocks, and that | |
949 | * entry is taken into account when balancing. | |
950 | */ | |
951 | static void | |
952 | xfs_dir2_leafn_rebalance( | |
953 | xfs_da_state_t *state, /* btree cursor */ | |
954 | xfs_da_state_blk_t *blk1, /* first btree block */ | |
955 | xfs_da_state_blk_t *blk2) /* second btree block */ | |
956 | { | |
957 | xfs_da_args_t *args; /* operation arguments */ | |
958 | int count; /* count (& direction) leaves */ | |
959 | int isleft; /* new goes in left leaf */ | |
960 | xfs_dir2_leaf_t *leaf1; /* first leaf structure */ | |
961 | xfs_dir2_leaf_t *leaf2; /* second leaf structure */ | |
962 | int mid; /* midpoint leaf index */ | |
742ae1e3 | 963 | #if defined(DEBUG) || defined(XFS_WARN) |
1da177e4 LT |
964 | int oldstale; /* old count of stale leaves */ |
965 | #endif | |
966 | int oldsum; /* old total leaf count */ | |
967 | int swap; /* swapped leaf blocks */ | |
24df33b4 DC |
968 | struct xfs_dir2_leaf_entry *ents1; |
969 | struct xfs_dir2_leaf_entry *ents2; | |
970 | struct xfs_dir3_icleaf_hdr hdr1; | |
971 | struct xfs_dir3_icleaf_hdr hdr2; | |
4141956a | 972 | struct xfs_inode *dp = state->args->dp; |
1da177e4 LT |
973 | |
974 | args = state->args; | |
975 | /* | |
976 | * If the block order is wrong, swap the arguments. | |
977 | */ | |
4141956a | 978 | if ((swap = xfs_dir2_leafn_order(dp, blk1->bp, blk2->bp))) { |
1da177e4 LT |
979 | xfs_da_state_blk_t *tmp; /* temp for block swap */ |
980 | ||
981 | tmp = blk1; | |
982 | blk1 = blk2; | |
983 | blk2 = tmp; | |
984 | } | |
1d9025e5 DC |
985 | leaf1 = blk1->bp->b_addr; |
986 | leaf2 = blk2->bp->b_addr; | |
01ba43b8 DC |
987 | dp->d_ops->leaf_hdr_from_disk(&hdr1, leaf1); |
988 | dp->d_ops->leaf_hdr_from_disk(&hdr2, leaf2); | |
4141956a DC |
989 | ents1 = dp->d_ops->leaf_ents_p(leaf1); |
990 | ents2 = dp->d_ops->leaf_ents_p(leaf2); | |
24df33b4 DC |
991 | |
992 | oldsum = hdr1.count + hdr2.count; | |
742ae1e3 | 993 | #if defined(DEBUG) || defined(XFS_WARN) |
24df33b4 | 994 | oldstale = hdr1.stale + hdr2.stale; |
1da177e4 LT |
995 | #endif |
996 | mid = oldsum >> 1; | |
24df33b4 | 997 | |
1da177e4 LT |
998 | /* |
999 | * If the old leaf count was odd then the new one will be even, | |
1000 | * so we need to divide the new count evenly. | |
1001 | */ | |
1002 | if (oldsum & 1) { | |
1003 | xfs_dahash_t midhash; /* middle entry hash value */ | |
1004 | ||
24df33b4 DC |
1005 | if (mid >= hdr1.count) |
1006 | midhash = be32_to_cpu(ents2[mid - hdr1.count].hashval); | |
1da177e4 | 1007 | else |
24df33b4 | 1008 | midhash = be32_to_cpu(ents1[mid].hashval); |
1da177e4 LT |
1009 | isleft = args->hashval <= midhash; |
1010 | } | |
1011 | /* | |
1012 | * If the old count is even then the new count is odd, so there's | |
1013 | * no preferred side for the new entry. | |
1014 | * Pick the left one. | |
1015 | */ | |
1016 | else | |
1017 | isleft = 1; | |
1018 | /* | |
1019 | * Calculate moved entry count. Positive means left-to-right, | |
1020 | * negative means right-to-left. Then move the entries. | |
1021 | */ | |
24df33b4 | 1022 | count = hdr1.count - mid + (isleft == 0); |
1da177e4 | 1023 | if (count > 0) |
24df33b4 DC |
1024 | xfs_dir3_leafn_moveents(args, blk1->bp, &hdr1, ents1, |
1025 | hdr1.count - count, blk2->bp, | |
1026 | &hdr2, ents2, 0, count); | |
1da177e4 | 1027 | else if (count < 0) |
24df33b4 DC |
1028 | xfs_dir3_leafn_moveents(args, blk2->bp, &hdr2, ents2, 0, |
1029 | blk1->bp, &hdr1, ents1, | |
1030 | hdr1.count, count); | |
1031 | ||
1032 | ASSERT(hdr1.count + hdr2.count == oldsum); | |
1033 | ASSERT(hdr1.stale + hdr2.stale == oldstale); | |
1034 | ||
1035 | /* log the changes made when moving the entries */ | |
01ba43b8 DC |
1036 | dp->d_ops->leaf_hdr_to_disk(leaf1, &hdr1); |
1037 | dp->d_ops->leaf_hdr_to_disk(leaf2, &hdr2); | |
bc85178a DC |
1038 | xfs_dir3_leaf_log_header(args, blk1->bp); |
1039 | xfs_dir3_leaf_log_header(args, blk2->bp); | |
24df33b4 | 1040 | |
4141956a DC |
1041 | xfs_dir3_leaf_check(dp, blk1->bp); |
1042 | xfs_dir3_leaf_check(dp, blk2->bp); | |
24df33b4 | 1043 | |
1da177e4 LT |
1044 | /* |
1045 | * Mark whether we're inserting into the old or new leaf. | |
1046 | */ | |
24df33b4 | 1047 | if (hdr1.count < hdr2.count) |
1da177e4 | 1048 | state->inleaf = swap; |
24df33b4 | 1049 | else if (hdr1.count > hdr2.count) |
1da177e4 LT |
1050 | state->inleaf = !swap; |
1051 | else | |
24df33b4 | 1052 | state->inleaf = swap ^ (blk1->index <= hdr1.count); |
1da177e4 LT |
1053 | /* |
1054 | * Adjust the expected index for insertion. | |
1055 | */ | |
1056 | if (!state->inleaf) | |
24df33b4 | 1057 | blk2->index = blk1->index - hdr1.count; |
f9f6dce0 BN |
1058 | |
1059 | /* | |
1060 | * Finally sanity check just to make sure we are not returning a | |
1061 | * negative index | |
1da177e4 | 1062 | */ |
4141956a | 1063 | if (blk2->index < 0) { |
1da177e4 LT |
1064 | state->inleaf = 1; |
1065 | blk2->index = 0; | |
4141956a | 1066 | xfs_alert(dp->i_mount, |
08e96e1a | 1067 | "%s: picked the wrong leaf? reverting original leaf: blk1->index %d", |
0b932ccc | 1068 | __func__, blk1->index); |
1da177e4 LT |
1069 | } |
1070 | } | |
1071 | ||
2025207c | 1072 | static int |
cbc8adf8 | 1073 | xfs_dir3_data_block_free( |
2025207c DC |
1074 | xfs_da_args_t *args, |
1075 | struct xfs_dir2_data_hdr *hdr, | |
1076 | struct xfs_dir2_free *free, | |
1077 | xfs_dir2_db_t fdb, | |
1078 | int findex, | |
1079 | struct xfs_buf *fbp, | |
1080 | int longest) | |
1081 | { | |
2025207c | 1082 | int logfree = 0; |
cbc8adf8 DC |
1083 | __be16 *bests; |
1084 | struct xfs_dir3_icfree_hdr freehdr; | |
01ba43b8 | 1085 | struct xfs_inode *dp = args->dp; |
2025207c | 1086 | |
01ba43b8 | 1087 | dp->d_ops->free_hdr_from_disk(&freehdr, free); |
24dd0f54 | 1088 | bests = dp->d_ops->free_bests_p(free); |
cbc8adf8 | 1089 | if (hdr) { |
2025207c | 1090 | /* |
cbc8adf8 DC |
1091 | * Data block is not empty, just set the free entry to the new |
1092 | * value. | |
2025207c | 1093 | */ |
cbc8adf8 | 1094 | bests[findex] = cpu_to_be16(longest); |
bc85178a | 1095 | xfs_dir2_free_log_bests(args, fbp, findex, findex); |
cbc8adf8 DC |
1096 | return 0; |
1097 | } | |
2025207c | 1098 | |
cbc8adf8 DC |
1099 | /* One less used entry in the free table. */ |
1100 | freehdr.nused--; | |
2025207c | 1101 | |
cbc8adf8 DC |
1102 | /* |
1103 | * If this was the last entry in the table, we can trim the table size | |
1104 | * back. There might be other entries at the end referring to | |
1105 | * non-existent data blocks, get those too. | |
1106 | */ | |
1107 | if (findex == freehdr.nvalid - 1) { | |
1108 | int i; /* free entry index */ | |
1109 | ||
1110 | for (i = findex - 1; i >= 0; i--) { | |
1111 | if (bests[i] != cpu_to_be16(NULLDATAOFF)) | |
1112 | break; | |
2025207c | 1113 | } |
cbc8adf8 DC |
1114 | freehdr.nvalid = i + 1; |
1115 | logfree = 0; | |
2025207c | 1116 | } else { |
cbc8adf8 DC |
1117 | /* Not the last entry, just punch it out. */ |
1118 | bests[findex] = cpu_to_be16(NULLDATAOFF); | |
1119 | logfree = 1; | |
1120 | } | |
1121 | ||
01ba43b8 | 1122 | dp->d_ops->free_hdr_to_disk(free, &freehdr); |
bc85178a | 1123 | xfs_dir2_free_log_header(args, fbp); |
cbc8adf8 DC |
1124 | |
1125 | /* | |
1126 | * If there are no useful entries left in the block, get rid of the | |
1127 | * block if we can. | |
1128 | */ | |
1129 | if (!freehdr.nused) { | |
1130 | int error; | |
1131 | ||
1132 | error = xfs_dir2_shrink_inode(args, fdb, fbp); | |
1133 | if (error == 0) { | |
1134 | fbp = NULL; | |
1135 | logfree = 0; | |
2451337d | 1136 | } else if (error != -ENOSPC || args->total != 0) |
cbc8adf8 | 1137 | return error; |
2025207c | 1138 | /* |
cbc8adf8 DC |
1139 | * It's possible to get ENOSPC if there is no |
1140 | * space reservation. In this case some one | |
1141 | * else will eventually get rid of this block. | |
2025207c | 1142 | */ |
2025207c DC |
1143 | } |
1144 | ||
1145 | /* Log the free entry that changed, unless we got rid of it. */ | |
1146 | if (logfree) | |
bc85178a | 1147 | xfs_dir2_free_log_bests(args, fbp, findex, findex); |
2025207c DC |
1148 | return 0; |
1149 | } | |
1150 | ||
1da177e4 LT |
1151 | /* |
1152 | * Remove an entry from a node directory. | |
1153 | * This removes the leaf entry and the data entry, | |
1154 | * and updates the free block if necessary. | |
1155 | */ | |
1156 | static int /* error */ | |
1157 | xfs_dir2_leafn_remove( | |
1158 | xfs_da_args_t *args, /* operation arguments */ | |
1d9025e5 | 1159 | struct xfs_buf *bp, /* leaf buffer */ |
1da177e4 LT |
1160 | int index, /* leaf entry index */ |
1161 | xfs_da_state_blk_t *dblk, /* data block */ | |
1162 | int *rval) /* resulting block needs join */ | |
1163 | { | |
c2066e26 | 1164 | xfs_dir2_data_hdr_t *hdr; /* data block header */ |
1da177e4 | 1165 | xfs_dir2_db_t db; /* data block number */ |
1d9025e5 | 1166 | struct xfs_buf *dbp; /* data block buffer */ |
1da177e4 LT |
1167 | xfs_dir2_data_entry_t *dep; /* data block entry */ |
1168 | xfs_inode_t *dp; /* incore directory inode */ | |
1169 | xfs_dir2_leaf_t *leaf; /* leaf structure */ | |
1170 | xfs_dir2_leaf_entry_t *lep; /* leaf entry */ | |
1171 | int longest; /* longest data free entry */ | |
1172 | int off; /* data block entry offset */ | |
1173 | xfs_mount_t *mp; /* filesystem mount point */ | |
1174 | int needlog; /* need to log data header */ | |
1175 | int needscan; /* need to rescan data frees */ | |
1176 | xfs_trans_t *tp; /* transaction pointer */ | |
33363fee | 1177 | struct xfs_dir2_data_free *bf; /* bestfree table */ |
24df33b4 DC |
1178 | struct xfs_dir3_icleaf_hdr leafhdr; |
1179 | struct xfs_dir2_leaf_entry *ents; | |
1da177e4 | 1180 | |
0b1b213f CH |
1181 | trace_xfs_dir2_leafn_remove(args, index); |
1182 | ||
1da177e4 LT |
1183 | dp = args->dp; |
1184 | tp = args->trans; | |
1185 | mp = dp->i_mount; | |
1d9025e5 | 1186 | leaf = bp->b_addr; |
01ba43b8 | 1187 | dp->d_ops->leaf_hdr_from_disk(&leafhdr, leaf); |
4141956a | 1188 | ents = dp->d_ops->leaf_ents_p(leaf); |
24df33b4 | 1189 | |
1da177e4 LT |
1190 | /* |
1191 | * Point to the entry we're removing. | |
1192 | */ | |
24df33b4 DC |
1193 | lep = &ents[index]; |
1194 | ||
1da177e4 LT |
1195 | /* |
1196 | * Extract the data block and offset from the entry. | |
1197 | */ | |
30028030 | 1198 | db = xfs_dir2_dataptr_to_db(args->geo, be32_to_cpu(lep->address)); |
1da177e4 | 1199 | ASSERT(dblk->blkno == db); |
30028030 | 1200 | off = xfs_dir2_dataptr_to_off(args->geo, be32_to_cpu(lep->address)); |
1da177e4 | 1201 | ASSERT(dblk->index == off); |
24df33b4 | 1202 | |
1da177e4 LT |
1203 | /* |
1204 | * Kill the leaf entry by marking it stale. | |
1205 | * Log the leaf block changes. | |
1206 | */ | |
24df33b4 | 1207 | leafhdr.stale++; |
01ba43b8 | 1208 | dp->d_ops->leaf_hdr_to_disk(leaf, &leafhdr); |
bc85178a | 1209 | xfs_dir3_leaf_log_header(args, bp); |
24df33b4 | 1210 | |
3c1f9c15 | 1211 | lep->address = cpu_to_be32(XFS_DIR2_NULL_DATAPTR); |
bc85178a | 1212 | xfs_dir3_leaf_log_ents(args, bp, index, index); |
24df33b4 | 1213 | |
1da177e4 LT |
1214 | /* |
1215 | * Make the data entry free. Keep track of the longest freespace | |
1216 | * in the data block in case it changes. | |
1217 | */ | |
1218 | dbp = dblk->bp; | |
1d9025e5 | 1219 | hdr = dbp->b_addr; |
c2066e26 | 1220 | dep = (xfs_dir2_data_entry_t *)((char *)hdr + off); |
2ca98774 | 1221 | bf = dp->d_ops->data_bestfree_p(hdr); |
33363fee | 1222 | longest = be16_to_cpu(bf[0].length); |
1da177e4 | 1223 | needlog = needscan = 0; |
bc85178a | 1224 | xfs_dir2_data_make_free(args, dbp, off, |
9d23fc85 | 1225 | dp->d_ops->data_entsize(dep->namelen), &needlog, &needscan); |
1da177e4 LT |
1226 | /* |
1227 | * Rescan the data block freespaces for bestfree. | |
1228 | * Log the data block header if needed. | |
1229 | */ | |
1230 | if (needscan) | |
9d23fc85 | 1231 | xfs_dir2_data_freescan(dp, hdr, &needlog); |
1da177e4 | 1232 | if (needlog) |
bc85178a | 1233 | xfs_dir2_data_log_header(args, dbp); |
33363fee | 1234 | xfs_dir3_data_check(dp, dbp); |
1da177e4 LT |
1235 | /* |
1236 | * If the longest data block freespace changes, need to update | |
1237 | * the corresponding freeblock entry. | |
1238 | */ | |
33363fee | 1239 | if (longest < be16_to_cpu(bf[0].length)) { |
1da177e4 | 1240 | int error; /* error return value */ |
1d9025e5 | 1241 | struct xfs_buf *fbp; /* freeblock buffer */ |
1da177e4 LT |
1242 | xfs_dir2_db_t fdb; /* freeblock block number */ |
1243 | int findex; /* index in freeblock entries */ | |
1244 | xfs_dir2_free_t *free; /* freeblock structure */ | |
1da177e4 LT |
1245 | |
1246 | /* | |
1247 | * Convert the data block number to a free block, | |
1248 | * read in the free block. | |
1249 | */ | |
8f66193c | 1250 | fdb = dp->d_ops->db_to_fdb(args->geo, db); |
2998ab1d DC |
1251 | error = xfs_dir2_free_read(tp, dp, |
1252 | xfs_dir2_db_to_da(args->geo, fdb), | |
2025207c | 1253 | &fbp); |
4bb20a83 | 1254 | if (error) |
1da177e4 | 1255 | return error; |
1d9025e5 | 1256 | free = fbp->b_addr; |
cbc8adf8 DC |
1257 | #ifdef DEBUG |
1258 | { | |
1259 | struct xfs_dir3_icfree_hdr freehdr; | |
01ba43b8 | 1260 | dp->d_ops->free_hdr_from_disk(&freehdr, free); |
8f66193c | 1261 | ASSERT(freehdr.firstdb == dp->d_ops->free_max_bests(args->geo) * |
30028030 DC |
1262 | (fdb - xfs_dir2_byte_to_db(args->geo, |
1263 | XFS_DIR2_FREE_OFFSET))); | |
cbc8adf8 DC |
1264 | } |
1265 | #endif | |
1da177e4 LT |
1266 | /* |
1267 | * Calculate which entry we need to fix. | |
1268 | */ | |
8f66193c | 1269 | findex = dp->d_ops->db_to_fdindex(args->geo, db); |
33363fee | 1270 | longest = be16_to_cpu(bf[0].length); |
1da177e4 LT |
1271 | /* |
1272 | * If the data block is now empty we can get rid of it | |
1273 | * (usually). | |
1274 | */ | |
8f66193c | 1275 | if (longest == args->geo->blksize - |
1c9a5b2e | 1276 | dp->d_ops->data_entry_offset) { |
1da177e4 LT |
1277 | /* |
1278 | * Try to punch out the data block. | |
1279 | */ | |
1280 | error = xfs_dir2_shrink_inode(args, db, dbp); | |
1281 | if (error == 0) { | |
1282 | dblk->bp = NULL; | |
c2066e26 | 1283 | hdr = NULL; |
1da177e4 LT |
1284 | } |
1285 | /* | |
1286 | * We can get ENOSPC if there's no space reservation. | |
1287 | * In this case just drop the buffer and some one else | |
1288 | * will eventually get rid of the empty block. | |
1289 | */ | |
2451337d | 1290 | else if (!(error == -ENOSPC && args->total == 0)) |
1da177e4 LT |
1291 | return error; |
1292 | } | |
1293 | /* | |
1294 | * If we got rid of the data block, we can eliminate that entry | |
1295 | * in the free block. | |
1296 | */ | |
cbc8adf8 | 1297 | error = xfs_dir3_data_block_free(args, hdr, free, |
2025207c DC |
1298 | fdb, findex, fbp, longest); |
1299 | if (error) | |
1300 | return error; | |
1da177e4 | 1301 | } |
2025207c | 1302 | |
4141956a | 1303 | xfs_dir3_leaf_check(dp, bp); |
1da177e4 | 1304 | /* |
9da096fd | 1305 | * Return indication of whether this leaf block is empty enough |
1da177e4 LT |
1306 | * to justify trying to join it with a neighbor. |
1307 | */ | |
1c9a5b2e | 1308 | *rval = (dp->d_ops->leaf_hdr_size + |
24df33b4 | 1309 | (uint)sizeof(ents[0]) * (leafhdr.count - leafhdr.stale)) < |
ed358c00 | 1310 | args->geo->magicpct; |
1da177e4 LT |
1311 | return 0; |
1312 | } | |
1313 | ||
1314 | /* | |
1315 | * Split the leaf entries in the old block into old and new blocks. | |
1316 | */ | |
1317 | int /* error */ | |
1318 | xfs_dir2_leafn_split( | |
1319 | xfs_da_state_t *state, /* btree cursor */ | |
1320 | xfs_da_state_blk_t *oldblk, /* original block */ | |
1321 | xfs_da_state_blk_t *newblk) /* newly created block */ | |
1322 | { | |
1323 | xfs_da_args_t *args; /* operation arguments */ | |
1324 | xfs_dablk_t blkno; /* new leaf block number */ | |
1325 | int error; /* error return value */ | |
1326 | xfs_mount_t *mp; /* filesystem mount point */ | |
4141956a | 1327 | struct xfs_inode *dp; |
1da177e4 LT |
1328 | |
1329 | /* | |
1330 | * Allocate space for a new leaf node. | |
1331 | */ | |
1332 | args = state->args; | |
4141956a DC |
1333 | dp = args->dp; |
1334 | mp = dp->i_mount; | |
1da177e4 LT |
1335 | ASSERT(oldblk->magic == XFS_DIR2_LEAFN_MAGIC); |
1336 | error = xfs_da_grow_inode(args, &blkno); | |
1337 | if (error) { | |
1338 | return error; | |
1339 | } | |
1340 | /* | |
1341 | * Initialize the new leaf block. | |
1342 | */ | |
2998ab1d | 1343 | error = xfs_dir3_leaf_get_buf(args, xfs_dir2_da_to_db(args->geo, blkno), |
24df33b4 DC |
1344 | &newblk->bp, XFS_DIR2_LEAFN_MAGIC); |
1345 | if (error) | |
1da177e4 | 1346 | return error; |
24df33b4 | 1347 | |
1da177e4 LT |
1348 | newblk->blkno = blkno; |
1349 | newblk->magic = XFS_DIR2_LEAFN_MAGIC; | |
1350 | /* | |
1351 | * Rebalance the entries across the two leaves, link the new | |
1352 | * block into the leaves. | |
1353 | */ | |
1354 | xfs_dir2_leafn_rebalance(state, oldblk, newblk); | |
f5ea1100 | 1355 | error = xfs_da3_blk_link(state, oldblk, newblk); |
1da177e4 LT |
1356 | if (error) { |
1357 | return error; | |
1358 | } | |
1359 | /* | |
1360 | * Insert the new entry in the correct block. | |
1361 | */ | |
1362 | if (state->inleaf) | |
1363 | error = xfs_dir2_leafn_add(oldblk->bp, args, oldblk->index); | |
1364 | else | |
1365 | error = xfs_dir2_leafn_add(newblk->bp, args, newblk->index); | |
1366 | /* | |
1367 | * Update last hashval in each block since we added the name. | |
1368 | */ | |
4141956a DC |
1369 | oldblk->hashval = xfs_dir2_leafn_lasthash(dp, oldblk->bp, NULL); |
1370 | newblk->hashval = xfs_dir2_leafn_lasthash(dp, newblk->bp, NULL); | |
1371 | xfs_dir3_leaf_check(dp, oldblk->bp); | |
1372 | xfs_dir3_leaf_check(dp, newblk->bp); | |
1da177e4 LT |
1373 | return error; |
1374 | } | |
1375 | ||
1376 | /* | |
1377 | * Check a leaf block and its neighbors to see if the block should be | |
1378 | * collapsed into one or the other neighbor. Always keep the block | |
1379 | * with the smaller block number. | |
1380 | * If the current block is over 50% full, don't try to join it, return 0. | |
1381 | * If the block is empty, fill in the state structure and return 2. | |
1382 | * If it can be collapsed, fill in the state structure and return 1. | |
1383 | * If nothing can be done, return 0. | |
1384 | */ | |
1385 | int /* error */ | |
1386 | xfs_dir2_leafn_toosmall( | |
1387 | xfs_da_state_t *state, /* btree cursor */ | |
1388 | int *action) /* resulting action to take */ | |
1389 | { | |
1390 | xfs_da_state_blk_t *blk; /* leaf block */ | |
1391 | xfs_dablk_t blkno; /* leaf block number */ | |
1d9025e5 | 1392 | struct xfs_buf *bp; /* leaf buffer */ |
1da177e4 LT |
1393 | int bytes; /* bytes in use */ |
1394 | int count; /* leaf live entry count */ | |
1395 | int error; /* error return value */ | |
1396 | int forward; /* sibling block direction */ | |
1397 | int i; /* sibling counter */ | |
1da177e4 LT |
1398 | xfs_dir2_leaf_t *leaf; /* leaf structure */ |
1399 | int rval; /* result from path_shift */ | |
24df33b4 DC |
1400 | struct xfs_dir3_icleaf_hdr leafhdr; |
1401 | struct xfs_dir2_leaf_entry *ents; | |
4141956a | 1402 | struct xfs_inode *dp = state->args->dp; |
1da177e4 LT |
1403 | |
1404 | /* | |
1405 | * Check for the degenerate case of the block being over 50% full. | |
1406 | * If so, it's not worth even looking to see if we might be able | |
1407 | * to coalesce with a sibling. | |
1408 | */ | |
1409 | blk = &state->path.blk[state->path.active - 1]; | |
24df33b4 | 1410 | leaf = blk->bp->b_addr; |
01ba43b8 | 1411 | dp->d_ops->leaf_hdr_from_disk(&leafhdr, leaf); |
4141956a DC |
1412 | ents = dp->d_ops->leaf_ents_p(leaf); |
1413 | xfs_dir3_leaf_check(dp, blk->bp); | |
24df33b4 DC |
1414 | |
1415 | count = leafhdr.count - leafhdr.stale; | |
1c9a5b2e | 1416 | bytes = dp->d_ops->leaf_hdr_size + count * sizeof(ents[0]); |
b2a21e7a | 1417 | if (bytes > (state->args->geo->blksize >> 1)) { |
1da177e4 LT |
1418 | /* |
1419 | * Blk over 50%, don't try to join. | |
1420 | */ | |
1421 | *action = 0; | |
1422 | return 0; | |
1423 | } | |
1424 | /* | |
1425 | * Check for the degenerate case of the block being empty. | |
1426 | * If the block is empty, we'll simply delete it, no need to | |
1427 | * coalesce it with a sibling block. We choose (arbitrarily) | |
1428 | * to merge with the forward block unless it is NULL. | |
1429 | */ | |
1430 | if (count == 0) { | |
1431 | /* | |
1432 | * Make altpath point to the block we want to keep and | |
1433 | * path point to the block we want to drop (this one). | |
1434 | */ | |
24df33b4 | 1435 | forward = (leafhdr.forw != 0); |
1da177e4 | 1436 | memcpy(&state->altpath, &state->path, sizeof(state->path)); |
f5ea1100 | 1437 | error = xfs_da3_path_shift(state, &state->altpath, forward, 0, |
1da177e4 LT |
1438 | &rval); |
1439 | if (error) | |
1440 | return error; | |
1441 | *action = rval ? 2 : 0; | |
1442 | return 0; | |
1443 | } | |
1444 | /* | |
1445 | * Examine each sibling block to see if we can coalesce with | |
1446 | * at least 25% free space to spare. We need to figure out | |
1447 | * whether to merge with the forward or the backward block. | |
1448 | * We prefer coalescing with the lower numbered sibling so as | |
1449 | * to shrink a directory over time. | |
1450 | */ | |
24df33b4 | 1451 | forward = leafhdr.forw < leafhdr.back; |
1da177e4 | 1452 | for (i = 0, bp = NULL; i < 2; forward = !forward, i++) { |
24df33b4 DC |
1453 | struct xfs_dir3_icleaf_hdr hdr2; |
1454 | ||
1455 | blkno = forward ? leafhdr.forw : leafhdr.back; | |
1da177e4 LT |
1456 | if (blkno == 0) |
1457 | continue; | |
1458 | /* | |
1459 | * Read the sibling leaf block. | |
1460 | */ | |
4141956a | 1461 | error = xfs_dir3_leafn_read(state->args->trans, dp, |
e6f7667c | 1462 | blkno, -1, &bp); |
4bb20a83 | 1463 | if (error) |
1da177e4 | 1464 | return error; |
e6f7667c | 1465 | |
1da177e4 LT |
1466 | /* |
1467 | * Count bytes in the two blocks combined. | |
1468 | */ | |
24df33b4 | 1469 | count = leafhdr.count - leafhdr.stale; |
b2a21e7a DC |
1470 | bytes = state->args->geo->blksize - |
1471 | (state->args->geo->blksize >> 2); | |
24df33b4 | 1472 | |
1d9025e5 | 1473 | leaf = bp->b_addr; |
01ba43b8 | 1474 | dp->d_ops->leaf_hdr_from_disk(&hdr2, leaf); |
4141956a | 1475 | ents = dp->d_ops->leaf_ents_p(leaf); |
24df33b4 DC |
1476 | count += hdr2.count - hdr2.stale; |
1477 | bytes -= count * sizeof(ents[0]); | |
1478 | ||
1da177e4 LT |
1479 | /* |
1480 | * Fits with at least 25% to spare. | |
1481 | */ | |
1482 | if (bytes >= 0) | |
1483 | break; | |
1d9025e5 | 1484 | xfs_trans_brelse(state->args->trans, bp); |
1da177e4 LT |
1485 | } |
1486 | /* | |
1487 | * Didn't like either block, give up. | |
1488 | */ | |
1489 | if (i >= 2) { | |
1490 | *action = 0; | |
1491 | return 0; | |
1492 | } | |
1d9025e5 | 1493 | |
1da177e4 LT |
1494 | /* |
1495 | * Make altpath point to the block we want to keep (the lower | |
1496 | * numbered block) and path point to the block we want to drop. | |
1497 | */ | |
1498 | memcpy(&state->altpath, &state->path, sizeof(state->path)); | |
1499 | if (blkno < blk->blkno) | |
f5ea1100 | 1500 | error = xfs_da3_path_shift(state, &state->altpath, forward, 0, |
1da177e4 LT |
1501 | &rval); |
1502 | else | |
f5ea1100 | 1503 | error = xfs_da3_path_shift(state, &state->path, forward, 0, |
1da177e4 LT |
1504 | &rval); |
1505 | if (error) { | |
1506 | return error; | |
1507 | } | |
1508 | *action = rval ? 0 : 1; | |
1509 | return 0; | |
1510 | } | |
1511 | ||
1512 | /* | |
1513 | * Move all the leaf entries from drop_blk to save_blk. | |
1514 | * This is done as part of a join operation. | |
1515 | */ | |
1516 | void | |
1517 | xfs_dir2_leafn_unbalance( | |
1518 | xfs_da_state_t *state, /* cursor */ | |
1519 | xfs_da_state_blk_t *drop_blk, /* dead block */ | |
1520 | xfs_da_state_blk_t *save_blk) /* surviving block */ | |
1521 | { | |
1522 | xfs_da_args_t *args; /* operation arguments */ | |
1523 | xfs_dir2_leaf_t *drop_leaf; /* dead leaf structure */ | |
1524 | xfs_dir2_leaf_t *save_leaf; /* surviving leaf structure */ | |
24df33b4 DC |
1525 | struct xfs_dir3_icleaf_hdr savehdr; |
1526 | struct xfs_dir3_icleaf_hdr drophdr; | |
1527 | struct xfs_dir2_leaf_entry *sents; | |
1528 | struct xfs_dir2_leaf_entry *dents; | |
4141956a | 1529 | struct xfs_inode *dp = state->args->dp; |
1da177e4 LT |
1530 | |
1531 | args = state->args; | |
1532 | ASSERT(drop_blk->magic == XFS_DIR2_LEAFN_MAGIC); | |
1533 | ASSERT(save_blk->magic == XFS_DIR2_LEAFN_MAGIC); | |
1d9025e5 DC |
1534 | drop_leaf = drop_blk->bp->b_addr; |
1535 | save_leaf = save_blk->bp->b_addr; | |
24df33b4 | 1536 | |
01ba43b8 DC |
1537 | dp->d_ops->leaf_hdr_from_disk(&savehdr, save_leaf); |
1538 | dp->d_ops->leaf_hdr_from_disk(&drophdr, drop_leaf); | |
1539 | sents = dp->d_ops->leaf_ents_p(save_leaf); | |
1540 | dents = dp->d_ops->leaf_ents_p(drop_leaf); | |
24df33b4 | 1541 | |
1da177e4 LT |
1542 | /* |
1543 | * If there are any stale leaf entries, take this opportunity | |
1544 | * to purge them. | |
1545 | */ | |
24df33b4 DC |
1546 | if (drophdr.stale) |
1547 | xfs_dir3_leaf_compact(args, &drophdr, drop_blk->bp); | |
1548 | if (savehdr.stale) | |
1549 | xfs_dir3_leaf_compact(args, &savehdr, save_blk->bp); | |
1550 | ||
1da177e4 LT |
1551 | /* |
1552 | * Move the entries from drop to the appropriate end of save. | |
1553 | */ | |
24df33b4 | 1554 | drop_blk->hashval = be32_to_cpu(dents[drophdr.count - 1].hashval); |
4141956a | 1555 | if (xfs_dir2_leafn_order(dp, save_blk->bp, drop_blk->bp)) |
24df33b4 DC |
1556 | xfs_dir3_leafn_moveents(args, drop_blk->bp, &drophdr, dents, 0, |
1557 | save_blk->bp, &savehdr, sents, 0, | |
1558 | drophdr.count); | |
1da177e4 | 1559 | else |
24df33b4 DC |
1560 | xfs_dir3_leafn_moveents(args, drop_blk->bp, &drophdr, dents, 0, |
1561 | save_blk->bp, &savehdr, sents, | |
1562 | savehdr.count, drophdr.count); | |
1563 | save_blk->hashval = be32_to_cpu(sents[savehdr.count - 1].hashval); | |
1564 | ||
1565 | /* log the changes made when moving the entries */ | |
01ba43b8 DC |
1566 | dp->d_ops->leaf_hdr_to_disk(save_leaf, &savehdr); |
1567 | dp->d_ops->leaf_hdr_to_disk(drop_leaf, &drophdr); | |
bc85178a DC |
1568 | xfs_dir3_leaf_log_header(args, save_blk->bp); |
1569 | xfs_dir3_leaf_log_header(args, drop_blk->bp); | |
24df33b4 | 1570 | |
4141956a DC |
1571 | xfs_dir3_leaf_check(dp, save_blk->bp); |
1572 | xfs_dir3_leaf_check(dp, drop_blk->bp); | |
1da177e4 LT |
1573 | } |
1574 | ||
1575 | /* | |
1576 | * Top-level node form directory addname routine. | |
1577 | */ | |
1578 | int /* error */ | |
1579 | xfs_dir2_node_addname( | |
1580 | xfs_da_args_t *args) /* operation arguments */ | |
1581 | { | |
1582 | xfs_da_state_blk_t *blk; /* leaf block for insert */ | |
1583 | int error; /* error return value */ | |
1584 | int rval; /* sub-return value */ | |
1585 | xfs_da_state_t *state; /* btree cursor */ | |
1586 | ||
0b1b213f CH |
1587 | trace_xfs_dir2_node_addname(args); |
1588 | ||
1da177e4 LT |
1589 | /* |
1590 | * Allocate and initialize the state (btree cursor). | |
1591 | */ | |
1592 | state = xfs_da_state_alloc(); | |
1593 | state->args = args; | |
1594 | state->mp = args->dp->i_mount; | |
1da177e4 LT |
1595 | /* |
1596 | * Look up the name. We're not supposed to find it, but | |
1597 | * this gives us the insertion point. | |
1598 | */ | |
f5ea1100 | 1599 | error = xfs_da3_node_lookup_int(state, &rval); |
1da177e4 LT |
1600 | if (error) |
1601 | rval = error; | |
2451337d | 1602 | if (rval != -ENOENT) { |
1da177e4 LT |
1603 | goto done; |
1604 | } | |
1605 | /* | |
1606 | * Add the data entry to a data block. | |
1607 | * Extravalid is set to a freeblock found by lookup. | |
1608 | */ | |
1609 | rval = xfs_dir2_node_addname_int(args, | |
1610 | state->extravalid ? &state->extrablk : NULL); | |
1611 | if (rval) { | |
1612 | goto done; | |
1613 | } | |
1614 | blk = &state->path.blk[state->path.active - 1]; | |
1615 | ASSERT(blk->magic == XFS_DIR2_LEAFN_MAGIC); | |
1616 | /* | |
1617 | * Add the new leaf entry. | |
1618 | */ | |
1619 | rval = xfs_dir2_leafn_add(blk->bp, args, blk->index); | |
1620 | if (rval == 0) { | |
1621 | /* | |
1622 | * It worked, fix the hash values up the btree. | |
1623 | */ | |
6a178100 | 1624 | if (!(args->op_flags & XFS_DA_OP_JUSTCHECK)) |
f5ea1100 | 1625 | xfs_da3_fixhashpath(state, &state->path); |
1da177e4 LT |
1626 | } else { |
1627 | /* | |
1628 | * It didn't work, we need to split the leaf block. | |
1629 | */ | |
1630 | if (args->total == 0) { | |
2451337d | 1631 | ASSERT(rval == -ENOSPC); |
1da177e4 LT |
1632 | goto done; |
1633 | } | |
1634 | /* | |
1635 | * Split the leaf block and insert the new entry. | |
1636 | */ | |
f5ea1100 | 1637 | rval = xfs_da3_split(state); |
1da177e4 LT |
1638 | } |
1639 | done: | |
1640 | xfs_da_state_free(state); | |
1641 | return rval; | |
1642 | } | |
1643 | ||
1644 | /* | |
1645 | * Add the data entry for a node-format directory name addition. | |
1646 | * The leaf entry is added in xfs_dir2_leafn_add. | |
1647 | * We may enter with a freespace block that the lookup found. | |
1648 | */ | |
1649 | static int /* error */ | |
1650 | xfs_dir2_node_addname_int( | |
1651 | xfs_da_args_t *args, /* operation arguments */ | |
1652 | xfs_da_state_blk_t *fblk) /* optional freespace block */ | |
1653 | { | |
c2066e26 | 1654 | xfs_dir2_data_hdr_t *hdr; /* data block header */ |
1da177e4 | 1655 | xfs_dir2_db_t dbno; /* data block number */ |
1d9025e5 | 1656 | struct xfs_buf *dbp; /* data block buffer */ |
1da177e4 LT |
1657 | xfs_dir2_data_entry_t *dep; /* data entry pointer */ |
1658 | xfs_inode_t *dp; /* incore directory inode */ | |
1659 | xfs_dir2_data_unused_t *dup; /* data unused entry pointer */ | |
1660 | int error; /* error return value */ | |
1661 | xfs_dir2_db_t fbno; /* freespace block number */ | |
1d9025e5 | 1662 | struct xfs_buf *fbp; /* freespace buffer */ |
1da177e4 LT |
1663 | int findex; /* freespace entry index */ |
1664 | xfs_dir2_free_t *free=NULL; /* freespace block structure */ | |
1665 | xfs_dir2_db_t ifbno; /* initial freespace block no */ | |
1666 | xfs_dir2_db_t lastfbno=0; /* highest freespace block no */ | |
1667 | int length; /* length of the new entry */ | |
1668 | int logfree; /* need to log free entry */ | |
1669 | xfs_mount_t *mp; /* filesystem mount point */ | |
1670 | int needlog; /* need to log data header */ | |
1671 | int needscan; /* need to rescan data frees */ | |
3d693c6e | 1672 | __be16 *tagp; /* data entry tag pointer */ |
1da177e4 | 1673 | xfs_trans_t *tp; /* transaction pointer */ |
cbc8adf8 DC |
1674 | __be16 *bests; |
1675 | struct xfs_dir3_icfree_hdr freehdr; | |
33363fee | 1676 | struct xfs_dir2_data_free *bf; |
1da177e4 LT |
1677 | |
1678 | dp = args->dp; | |
1679 | mp = dp->i_mount; | |
1680 | tp = args->trans; | |
9d23fc85 | 1681 | length = dp->d_ops->data_entsize(args->namelen); |
1da177e4 LT |
1682 | /* |
1683 | * If we came in with a freespace block that means that lookup | |
1684 | * found an entry with our hash value. This is the freespace | |
1685 | * block for that data entry. | |
1686 | */ | |
1687 | if (fblk) { | |
1688 | fbp = fblk->bp; | |
1689 | /* | |
1690 | * Remember initial freespace block number. | |
1691 | */ | |
1692 | ifbno = fblk->blkno; | |
1d9025e5 | 1693 | free = fbp->b_addr; |
1da177e4 | 1694 | findex = fblk->index; |
24dd0f54 | 1695 | bests = dp->d_ops->free_bests_p(free); |
01ba43b8 | 1696 | dp->d_ops->free_hdr_from_disk(&freehdr, free); |
cbc8adf8 | 1697 | |
1da177e4 LT |
1698 | /* |
1699 | * This means the free entry showed that the data block had | |
1700 | * space for our entry, so we remembered it. | |
1701 | * Use that data block. | |
1702 | */ | |
1703 | if (findex >= 0) { | |
cbc8adf8 DC |
1704 | ASSERT(findex < freehdr.nvalid); |
1705 | ASSERT(be16_to_cpu(bests[findex]) != NULLDATAOFF); | |
1706 | ASSERT(be16_to_cpu(bests[findex]) >= length); | |
1707 | dbno = freehdr.firstdb + findex; | |
1708 | } else { | |
1709 | /* | |
1710 | * The data block looked at didn't have enough room. | |
1711 | * We'll start at the beginning of the freespace entries. | |
1712 | */ | |
1da177e4 LT |
1713 | dbno = -1; |
1714 | findex = 0; | |
1715 | } | |
cbc8adf8 DC |
1716 | } else { |
1717 | /* | |
1718 | * Didn't come in with a freespace block, so no data block. | |
1719 | */ | |
1da177e4 LT |
1720 | ifbno = dbno = -1; |
1721 | fbp = NULL; | |
1722 | findex = 0; | |
1723 | } | |
cbc8adf8 | 1724 | |
1da177e4 LT |
1725 | /* |
1726 | * If we don't have a data block yet, we're going to scan the | |
1727 | * freespace blocks looking for one. Figure out what the | |
1728 | * highest freespace block number is. | |
1729 | */ | |
1730 | if (dbno == -1) { | |
1731 | xfs_fileoff_t fo; /* freespace block number */ | |
1732 | ||
7fb2cd4d | 1733 | if ((error = xfs_bmap_last_offset(dp, &fo, XFS_DATA_FORK))) |
1da177e4 | 1734 | return error; |
2998ab1d | 1735 | lastfbno = xfs_dir2_da_to_db(args->geo, (xfs_dablk_t)fo); |
1da177e4 LT |
1736 | fbno = ifbno; |
1737 | } | |
1738 | /* | |
1739 | * While we haven't identified a data block, search the freeblock | |
1740 | * data for a good data block. If we find a null freeblock entry, | |
1741 | * indicating a hole in the data blocks, remember that. | |
1742 | */ | |
1743 | while (dbno == -1) { | |
1744 | /* | |
1745 | * If we don't have a freeblock in hand, get the next one. | |
1746 | */ | |
1747 | if (fbp == NULL) { | |
1748 | /* | |
1749 | * Happens the first time through unless lookup gave | |
1750 | * us a freespace block to start with. | |
1751 | */ | |
1752 | if (++fbno == 0) | |
30028030 | 1753 | fbno = xfs_dir2_byte_to_db(args->geo, |
8c44a285 | 1754 | XFS_DIR2_FREE_OFFSET); |
1da177e4 LT |
1755 | /* |
1756 | * If it's ifbno we already looked at it. | |
1757 | */ | |
1758 | if (fbno == ifbno) | |
1759 | fbno++; | |
1760 | /* | |
1761 | * If it's off the end we're done. | |
1762 | */ | |
1763 | if (fbno >= lastfbno) | |
1764 | break; | |
1765 | /* | |
1766 | * Read the block. There can be holes in the | |
1767 | * freespace blocks, so this might not succeed. | |
1768 | * This should be really rare, so there's no reason | |
1769 | * to avoid it. | |
1770 | */ | |
2025207c | 1771 | error = xfs_dir2_free_try_read(tp, dp, |
2998ab1d DC |
1772 | xfs_dir2_db_to_da(args->geo, fbno), |
1773 | &fbp); | |
4bb20a83 | 1774 | if (error) |
1da177e4 | 1775 | return error; |
4bb20a83 | 1776 | if (!fbp) |
1da177e4 | 1777 | continue; |
1d9025e5 | 1778 | free = fbp->b_addr; |
1da177e4 LT |
1779 | findex = 0; |
1780 | } | |
1781 | /* | |
1782 | * Look at the current free entry. Is it good enough? | |
cbc8adf8 DC |
1783 | * |
1784 | * The bests initialisation should be where the bufer is read in | |
1785 | * the above branch. But gcc is too stupid to realise that bests | |
1786 | * and the freehdr are actually initialised if they are placed | |
1787 | * there, so we have to do it here to avoid warnings. Blech. | |
1da177e4 | 1788 | */ |
24dd0f54 | 1789 | bests = dp->d_ops->free_bests_p(free); |
01ba43b8 | 1790 | dp->d_ops->free_hdr_from_disk(&freehdr, free); |
cbc8adf8 DC |
1791 | if (be16_to_cpu(bests[findex]) != NULLDATAOFF && |
1792 | be16_to_cpu(bests[findex]) >= length) | |
1793 | dbno = freehdr.firstdb + findex; | |
1da177e4 LT |
1794 | else { |
1795 | /* | |
1796 | * Are we done with the freeblock? | |
1797 | */ | |
cbc8adf8 | 1798 | if (++findex == freehdr.nvalid) { |
1da177e4 LT |
1799 | /* |
1800 | * Drop the block. | |
1801 | */ | |
1d9025e5 | 1802 | xfs_trans_brelse(tp, fbp); |
1da177e4 LT |
1803 | fbp = NULL; |
1804 | if (fblk && fblk->bp) | |
1805 | fblk->bp = NULL; | |
1806 | } | |
1807 | } | |
1808 | } | |
1809 | /* | |
1810 | * If we don't have a data block, we need to allocate one and make | |
1811 | * the freespace entries refer to it. | |
1812 | */ | |
1813 | if (unlikely(dbno == -1)) { | |
1814 | /* | |
1815 | * Not allowed to allocate, return failure. | |
1816 | */ | |
1d9025e5 | 1817 | if ((args->op_flags & XFS_DA_OP_JUSTCHECK) || args->total == 0) |
2451337d | 1818 | return -ENOSPC; |
1d9025e5 | 1819 | |
1da177e4 LT |
1820 | /* |
1821 | * Allocate and initialize the new data block. | |
1822 | */ | |
1823 | if (unlikely((error = xfs_dir2_grow_inode(args, | |
1824 | XFS_DIR2_DATA_SPACE, | |
1825 | &dbno)) || | |
f5f3d9b0 | 1826 | (error = xfs_dir3_data_init(args, dbno, &dbp)))) |
1da177e4 | 1827 | return error; |
1d9025e5 | 1828 | |
1da177e4 LT |
1829 | /* |
1830 | * If (somehow) we have a freespace block, get rid of it. | |
1831 | */ | |
1832 | if (fbp) | |
1d9025e5 | 1833 | xfs_trans_brelse(tp, fbp); |
1da177e4 LT |
1834 | if (fblk && fblk->bp) |
1835 | fblk->bp = NULL; | |
1836 | ||
1837 | /* | |
1838 | * Get the freespace block corresponding to the data block | |
1839 | * that was just allocated. | |
1840 | */ | |
8f66193c | 1841 | fbno = dp->d_ops->db_to_fdb(args->geo, dbno); |
2025207c | 1842 | error = xfs_dir2_free_try_read(tp, dp, |
2998ab1d DC |
1843 | xfs_dir2_db_to_da(args->geo, fbno), |
1844 | &fbp); | |
4bb20a83 | 1845 | if (error) |
1da177e4 | 1846 | return error; |
1d9025e5 | 1847 | |
1da177e4 LT |
1848 | /* |
1849 | * If there wasn't a freespace block, the read will | |
1850 | * return a NULL fbp. Allocate and initialize a new one. | |
1851 | */ | |
cbc8adf8 DC |
1852 | if (!fbp) { |
1853 | error = xfs_dir2_grow_inode(args, XFS_DIR2_FREE_SPACE, | |
1854 | &fbno); | |
1855 | if (error) | |
1da177e4 | 1856 | return error; |
1da177e4 | 1857 | |
8f66193c | 1858 | if (dp->d_ops->db_to_fdb(args->geo, dbno) != fbno) { |
0b932ccc | 1859 | xfs_alert(mp, |
df2e301f | 1860 | "%s: dir ino %llu needed freesp block %lld for\n" |
0b932ccc DC |
1861 | " data block %lld, got %lld ifbno %llu lastfbno %d", |
1862 | __func__, (unsigned long long)dp->i_ino, | |
8f66193c DC |
1863 | (long long)dp->d_ops->db_to_fdb( |
1864 | args->geo, dbno), | |
1da177e4 LT |
1865 | (long long)dbno, (long long)fbno, |
1866 | (unsigned long long)ifbno, lastfbno); | |
1867 | if (fblk) { | |
0b932ccc DC |
1868 | xfs_alert(mp, |
1869 | " fblk 0x%p blkno %llu index %d magic 0x%x", | |
1da177e4 LT |
1870 | fblk, |
1871 | (unsigned long long)fblk->blkno, | |
1872 | fblk->index, | |
1873 | fblk->magic); | |
1874 | } else { | |
0b932ccc | 1875 | xfs_alert(mp, " ... fblk is NULL"); |
1da177e4 LT |
1876 | } |
1877 | XFS_ERROR_REPORT("xfs_dir2_node_addname_int", | |
1878 | XFS_ERRLEVEL_LOW, mp); | |
2451337d | 1879 | return -EFSCORRUPTED; |
1da177e4 LT |
1880 | } |
1881 | ||
1882 | /* | |
1883 | * Get a buffer for the new block. | |
1884 | */ | |
2998ab1d | 1885 | error = xfs_dir3_free_get_buf(args, fbno, &fbp); |
b0f539de | 1886 | if (error) |
1da177e4 | 1887 | return error; |
cbc8adf8 | 1888 | free = fbp->b_addr; |
24dd0f54 | 1889 | bests = dp->d_ops->free_bests_p(free); |
01ba43b8 | 1890 | dp->d_ops->free_hdr_from_disk(&freehdr, free); |
1da177e4 LT |
1891 | |
1892 | /* | |
cbc8adf8 | 1893 | * Remember the first slot as our empty slot. |
1da177e4 | 1894 | */ |
8c44a285 | 1895 | freehdr.firstdb = |
30028030 | 1896 | (fbno - xfs_dir2_byte_to_db(args->geo, |
8c44a285 | 1897 | XFS_DIR2_FREE_OFFSET)) * |
8f66193c | 1898 | dp->d_ops->free_max_bests(args->geo); |
1da177e4 | 1899 | } else { |
1d9025e5 | 1900 | free = fbp->b_addr; |
24dd0f54 | 1901 | bests = dp->d_ops->free_bests_p(free); |
01ba43b8 | 1902 | dp->d_ops->free_hdr_from_disk(&freehdr, free); |
1da177e4 LT |
1903 | } |
1904 | ||
1905 | /* | |
1906 | * Set the freespace block index from the data block number. | |
1907 | */ | |
8f66193c | 1908 | findex = dp->d_ops->db_to_fdindex(args->geo, dbno); |
1da177e4 LT |
1909 | /* |
1910 | * If it's after the end of the current entries in the | |
1911 | * freespace block, extend that table. | |
1912 | */ | |
cbc8adf8 | 1913 | if (findex >= freehdr.nvalid) { |
8f66193c | 1914 | ASSERT(findex < dp->d_ops->free_max_bests(args->geo)); |
cbc8adf8 | 1915 | freehdr.nvalid = findex + 1; |
1da177e4 LT |
1916 | /* |
1917 | * Tag new entry so nused will go up. | |
1918 | */ | |
cbc8adf8 | 1919 | bests[findex] = cpu_to_be16(NULLDATAOFF); |
1da177e4 LT |
1920 | } |
1921 | /* | |
1922 | * If this entry was for an empty data block | |
1923 | * (this should always be true) then update the header. | |
1924 | */ | |
cbc8adf8 DC |
1925 | if (bests[findex] == cpu_to_be16(NULLDATAOFF)) { |
1926 | freehdr.nused++; | |
01ba43b8 | 1927 | dp->d_ops->free_hdr_to_disk(fbp->b_addr, &freehdr); |
bc85178a | 1928 | xfs_dir2_free_log_header(args, fbp); |
1da177e4 LT |
1929 | } |
1930 | /* | |
1931 | * Update the real value in the table. | |
1932 | * We haven't allocated the data entry yet so this will | |
1933 | * change again. | |
1934 | */ | |
1d9025e5 | 1935 | hdr = dbp->b_addr; |
2ca98774 | 1936 | bf = dp->d_ops->data_bestfree_p(hdr); |
33363fee | 1937 | bests[findex] = bf[0].length; |
1da177e4 LT |
1938 | logfree = 1; |
1939 | } | |
1940 | /* | |
1941 | * We had a data block so we don't have to make a new one. | |
1942 | */ | |
1943 | else { | |
1944 | /* | |
1945 | * If just checking, we succeeded. | |
1946 | */ | |
1d9025e5 | 1947 | if (args->op_flags & XFS_DA_OP_JUSTCHECK) |
1da177e4 | 1948 | return 0; |
1d9025e5 | 1949 | |
1da177e4 LT |
1950 | /* |
1951 | * Read the data block in. | |
1952 | */ | |
2998ab1d DC |
1953 | error = xfs_dir3_data_read(tp, dp, |
1954 | xfs_dir2_db_to_da(args->geo, dbno), | |
e4813572 | 1955 | -1, &dbp); |
1d9025e5 | 1956 | if (error) |
1da177e4 | 1957 | return error; |
1d9025e5 | 1958 | hdr = dbp->b_addr; |
2ca98774 | 1959 | bf = dp->d_ops->data_bestfree_p(hdr); |
1da177e4 LT |
1960 | logfree = 0; |
1961 | } | |
33363fee | 1962 | ASSERT(be16_to_cpu(bf[0].length) >= length); |
1da177e4 LT |
1963 | /* |
1964 | * Point to the existing unused space. | |
1965 | */ | |
1966 | dup = (xfs_dir2_data_unused_t *) | |
33363fee | 1967 | ((char *)hdr + be16_to_cpu(bf[0].offset)); |
1da177e4 LT |
1968 | needscan = needlog = 0; |
1969 | /* | |
1970 | * Mark the first part of the unused space, inuse for us. | |
1971 | */ | |
bc85178a | 1972 | xfs_dir2_data_use_free(args, dbp, dup, |
c2066e26 | 1973 | (xfs_dir2_data_aoff_t)((char *)dup - (char *)hdr), length, |
1da177e4 LT |
1974 | &needlog, &needscan); |
1975 | /* | |
1976 | * Fill in the new entry and log it. | |
1977 | */ | |
1978 | dep = (xfs_dir2_data_entry_t *)dup; | |
ff9901c1 | 1979 | dep->inumber = cpu_to_be64(args->inumber); |
1da177e4 LT |
1980 | dep->namelen = args->namelen; |
1981 | memcpy(dep->name, args->name, dep->namelen); | |
9d23fc85 DC |
1982 | dp->d_ops->data_put_ftype(dep, args->filetype); |
1983 | tagp = dp->d_ops->data_entry_tag_p(dep); | |
c2066e26 | 1984 | *tagp = cpu_to_be16((char *)dep - (char *)hdr); |
bc85178a | 1985 | xfs_dir2_data_log_entry(args, dbp, dep); |
1da177e4 LT |
1986 | /* |
1987 | * Rescan the block for bestfree if needed. | |
1988 | */ | |
1989 | if (needscan) | |
9d23fc85 | 1990 | xfs_dir2_data_freescan(dp, hdr, &needlog); |
1da177e4 LT |
1991 | /* |
1992 | * Log the data block header if needed. | |
1993 | */ | |
1994 | if (needlog) | |
bc85178a | 1995 | xfs_dir2_data_log_header(args, dbp); |
1da177e4 LT |
1996 | /* |
1997 | * If the freespace entry is now wrong, update it. | |
1998 | */ | |
24dd0f54 | 1999 | bests = dp->d_ops->free_bests_p(free); /* gcc is so stupid */ |
33363fee DC |
2000 | if (be16_to_cpu(bests[findex]) != be16_to_cpu(bf[0].length)) { |
2001 | bests[findex] = bf[0].length; | |
1da177e4 LT |
2002 | logfree = 1; |
2003 | } | |
2004 | /* | |
2005 | * Log the freespace entry if needed. | |
2006 | */ | |
2007 | if (logfree) | |
bc85178a | 2008 | xfs_dir2_free_log_bests(args, fbp, findex, findex); |
1da177e4 LT |
2009 | /* |
2010 | * Return the data block and offset in args, then drop the data block. | |
2011 | */ | |
2012 | args->blkno = (xfs_dablk_t)dbno; | |
3d693c6e | 2013 | args->index = be16_to_cpu(*tagp); |
1da177e4 LT |
2014 | return 0; |
2015 | } | |
2016 | ||
2017 | /* | |
2018 | * Lookup an entry in a node-format directory. | |
f5ea1100 | 2019 | * All the real work happens in xfs_da3_node_lookup_int. |
1da177e4 LT |
2020 | * The only real output is the inode number of the entry. |
2021 | */ | |
2022 | int /* error */ | |
2023 | xfs_dir2_node_lookup( | |
2024 | xfs_da_args_t *args) /* operation arguments */ | |
2025 | { | |
2026 | int error; /* error return value */ | |
2027 | int i; /* btree level */ | |
2028 | int rval; /* operation return value */ | |
2029 | xfs_da_state_t *state; /* btree cursor */ | |
2030 | ||
0b1b213f CH |
2031 | trace_xfs_dir2_node_lookup(args); |
2032 | ||
1da177e4 LT |
2033 | /* |
2034 | * Allocate and initialize the btree cursor. | |
2035 | */ | |
2036 | state = xfs_da_state_alloc(); | |
2037 | state->args = args; | |
2038 | state->mp = args->dp->i_mount; | |
1da177e4 LT |
2039 | /* |
2040 | * Fill in the path to the entry in the cursor. | |
2041 | */ | |
f5ea1100 | 2042 | error = xfs_da3_node_lookup_int(state, &rval); |
1da177e4 LT |
2043 | if (error) |
2044 | rval = error; | |
2451337d DC |
2045 | else if (rval == -ENOENT && args->cmpresult == XFS_CMP_CASE) { |
2046 | /* If a CI match, dup the actual name and return -EEXIST */ | |
384f3ced BN |
2047 | xfs_dir2_data_entry_t *dep; |
2048 | ||
1d9025e5 DC |
2049 | dep = (xfs_dir2_data_entry_t *) |
2050 | ((char *)state->extrablk.bp->b_addr + | |
2051 | state->extrablk.index); | |
384f3ced BN |
2052 | rval = xfs_dir_cilookup_result(args, dep->name, dep->namelen); |
2053 | } | |
1da177e4 LT |
2054 | /* |
2055 | * Release the btree blocks and leaf block. | |
2056 | */ | |
2057 | for (i = 0; i < state->path.active; i++) { | |
1d9025e5 | 2058 | xfs_trans_brelse(args->trans, state->path.blk[i].bp); |
1da177e4 LT |
2059 | state->path.blk[i].bp = NULL; |
2060 | } | |
2061 | /* | |
2062 | * Release the data block if we have it. | |
2063 | */ | |
2064 | if (state->extravalid && state->extrablk.bp) { | |
1d9025e5 | 2065 | xfs_trans_brelse(args->trans, state->extrablk.bp); |
1da177e4 LT |
2066 | state->extrablk.bp = NULL; |
2067 | } | |
2068 | xfs_da_state_free(state); | |
2069 | return rval; | |
2070 | } | |
2071 | ||
2072 | /* | |
2073 | * Remove an entry from a node-format directory. | |
2074 | */ | |
2075 | int /* error */ | |
2076 | xfs_dir2_node_removename( | |
3a8c9208 | 2077 | struct xfs_da_args *args) /* operation arguments */ |
1da177e4 | 2078 | { |
3a8c9208 | 2079 | struct xfs_da_state_blk *blk; /* leaf block */ |
1da177e4 LT |
2080 | int error; /* error return value */ |
2081 | int rval; /* operation return value */ | |
3a8c9208 | 2082 | struct xfs_da_state *state; /* btree cursor */ |
1da177e4 | 2083 | |
0b1b213f CH |
2084 | trace_xfs_dir2_node_removename(args); |
2085 | ||
1da177e4 LT |
2086 | /* |
2087 | * Allocate and initialize the btree cursor. | |
2088 | */ | |
2089 | state = xfs_da_state_alloc(); | |
2090 | state->args = args; | |
2091 | state->mp = args->dp->i_mount; | |
3a8c9208 MT |
2092 | |
2093 | /* Look up the entry we're deleting, set up the cursor. */ | |
f5ea1100 | 2094 | error = xfs_da3_node_lookup_int(state, &rval); |
5163f95a | 2095 | if (error) |
3a8c9208 MT |
2096 | goto out_free; |
2097 | ||
2098 | /* Didn't find it, upper layer screwed up. */ | |
2451337d | 2099 | if (rval != -EEXIST) { |
3a8c9208 MT |
2100 | error = rval; |
2101 | goto out_free; | |
1da177e4 | 2102 | } |
3a8c9208 | 2103 | |
1da177e4 LT |
2104 | blk = &state->path.blk[state->path.active - 1]; |
2105 | ASSERT(blk->magic == XFS_DIR2_LEAFN_MAGIC); | |
2106 | ASSERT(state->extravalid); | |
2107 | /* | |
2108 | * Remove the leaf and data entries. | |
2109 | * Extrablk refers to the data block. | |
2110 | */ | |
2111 | error = xfs_dir2_leafn_remove(args, blk->bp, blk->index, | |
2112 | &state->extrablk, &rval); | |
5163f95a | 2113 | if (error) |
3a8c9208 | 2114 | goto out_free; |
1da177e4 LT |
2115 | /* |
2116 | * Fix the hash values up the btree. | |
2117 | */ | |
f5ea1100 | 2118 | xfs_da3_fixhashpath(state, &state->path); |
1da177e4 LT |
2119 | /* |
2120 | * If we need to join leaf blocks, do it. | |
2121 | */ | |
2122 | if (rval && state->path.active > 1) | |
f5ea1100 | 2123 | error = xfs_da3_join(state); |
1da177e4 LT |
2124 | /* |
2125 | * If no errors so far, try conversion to leaf format. | |
2126 | */ | |
2127 | if (!error) | |
2128 | error = xfs_dir2_node_to_leaf(state); | |
3a8c9208 | 2129 | out_free: |
1da177e4 LT |
2130 | xfs_da_state_free(state); |
2131 | return error; | |
2132 | } | |
2133 | ||
2134 | /* | |
2135 | * Replace an entry's inode number in a node-format directory. | |
2136 | */ | |
2137 | int /* error */ | |
2138 | xfs_dir2_node_replace( | |
2139 | xfs_da_args_t *args) /* operation arguments */ | |
2140 | { | |
2141 | xfs_da_state_blk_t *blk; /* leaf block */ | |
c2066e26 | 2142 | xfs_dir2_data_hdr_t *hdr; /* data block header */ |
1da177e4 LT |
2143 | xfs_dir2_data_entry_t *dep; /* data entry changed */ |
2144 | int error; /* error return value */ | |
2145 | int i; /* btree level */ | |
2146 | xfs_ino_t inum; /* new inode number */ | |
2147 | xfs_dir2_leaf_t *leaf; /* leaf structure */ | |
2148 | xfs_dir2_leaf_entry_t *lep; /* leaf entry being changed */ | |
2149 | int rval; /* internal return value */ | |
2150 | xfs_da_state_t *state; /* btree cursor */ | |
2151 | ||
0b1b213f CH |
2152 | trace_xfs_dir2_node_replace(args); |
2153 | ||
1da177e4 LT |
2154 | /* |
2155 | * Allocate and initialize the btree cursor. | |
2156 | */ | |
2157 | state = xfs_da_state_alloc(); | |
2158 | state->args = args; | |
2159 | state->mp = args->dp->i_mount; | |
1da177e4 LT |
2160 | inum = args->inumber; |
2161 | /* | |
2162 | * Lookup the entry to change in the btree. | |
2163 | */ | |
f5ea1100 | 2164 | error = xfs_da3_node_lookup_int(state, &rval); |
1da177e4 LT |
2165 | if (error) { |
2166 | rval = error; | |
2167 | } | |
2168 | /* | |
2169 | * It should be found, since the vnodeops layer has looked it up | |
2170 | * and locked it. But paranoia is good. | |
2171 | */ | |
2451337d | 2172 | if (rval == -EEXIST) { |
24df33b4 | 2173 | struct xfs_dir2_leaf_entry *ents; |
1da177e4 LT |
2174 | /* |
2175 | * Find the leaf entry. | |
2176 | */ | |
2177 | blk = &state->path.blk[state->path.active - 1]; | |
2178 | ASSERT(blk->magic == XFS_DIR2_LEAFN_MAGIC); | |
1d9025e5 | 2179 | leaf = blk->bp->b_addr; |
4141956a | 2180 | ents = args->dp->d_ops->leaf_ents_p(leaf); |
24df33b4 | 2181 | lep = &ents[blk->index]; |
1da177e4 LT |
2182 | ASSERT(state->extravalid); |
2183 | /* | |
2184 | * Point to the data entry. | |
2185 | */ | |
1d9025e5 | 2186 | hdr = state->extrablk.bp->b_addr; |
33363fee DC |
2187 | ASSERT(hdr->magic == cpu_to_be32(XFS_DIR2_DATA_MAGIC) || |
2188 | hdr->magic == cpu_to_be32(XFS_DIR3_DATA_MAGIC)); | |
1da177e4 | 2189 | dep = (xfs_dir2_data_entry_t *) |
c2066e26 | 2190 | ((char *)hdr + |
30028030 DC |
2191 | xfs_dir2_dataptr_to_off(args->geo, |
2192 | be32_to_cpu(lep->address))); | |
ff9901c1 | 2193 | ASSERT(inum != be64_to_cpu(dep->inumber)); |
1da177e4 LT |
2194 | /* |
2195 | * Fill in the new inode number and log the entry. | |
2196 | */ | |
ff9901c1 | 2197 | dep->inumber = cpu_to_be64(inum); |
9d23fc85 | 2198 | args->dp->d_ops->data_put_ftype(dep, args->filetype); |
bc85178a | 2199 | xfs_dir2_data_log_entry(args, state->extrablk.bp, dep); |
1da177e4 LT |
2200 | rval = 0; |
2201 | } | |
2202 | /* | |
2203 | * Didn't find it, and we're holding a data block. Drop it. | |
2204 | */ | |
2205 | else if (state->extravalid) { | |
1d9025e5 | 2206 | xfs_trans_brelse(args->trans, state->extrablk.bp); |
1da177e4 LT |
2207 | state->extrablk.bp = NULL; |
2208 | } | |
2209 | /* | |
2210 | * Release all the buffers in the cursor. | |
2211 | */ | |
2212 | for (i = 0; i < state->path.active; i++) { | |
1d9025e5 | 2213 | xfs_trans_brelse(args->trans, state->path.blk[i].bp); |
1da177e4 LT |
2214 | state->path.blk[i].bp = NULL; |
2215 | } | |
2216 | xfs_da_state_free(state); | |
2217 | return rval; | |
2218 | } | |
2219 | ||
2220 | /* | |
2221 | * Trim off a trailing empty freespace block. | |
2222 | * Return (in rvalp) 1 if we did it, 0 if not. | |
2223 | */ | |
2224 | int /* error */ | |
2225 | xfs_dir2_node_trim_free( | |
2226 | xfs_da_args_t *args, /* operation arguments */ | |
2227 | xfs_fileoff_t fo, /* free block number */ | |
2228 | int *rvalp) /* out: did something */ | |
2229 | { | |
1d9025e5 | 2230 | struct xfs_buf *bp; /* freespace buffer */ |
1da177e4 LT |
2231 | xfs_inode_t *dp; /* incore directory inode */ |
2232 | int error; /* error return code */ | |
2233 | xfs_dir2_free_t *free; /* freespace structure */ | |
2234 | xfs_mount_t *mp; /* filesystem mount point */ | |
2235 | xfs_trans_t *tp; /* transaction pointer */ | |
cbc8adf8 | 2236 | struct xfs_dir3_icfree_hdr freehdr; |
1da177e4 LT |
2237 | |
2238 | dp = args->dp; | |
2239 | mp = dp->i_mount; | |
2240 | tp = args->trans; | |
2241 | /* | |
2242 | * Read the freespace block. | |
2243 | */ | |
2025207c | 2244 | error = xfs_dir2_free_try_read(tp, dp, fo, &bp); |
4bb20a83 | 2245 | if (error) |
1da177e4 | 2246 | return error; |
1da177e4 LT |
2247 | /* |
2248 | * There can be holes in freespace. If fo is a hole, there's | |
2249 | * nothing to do. | |
2250 | */ | |
2025207c | 2251 | if (!bp) |
1da177e4 | 2252 | return 0; |
1d9025e5 | 2253 | free = bp->b_addr; |
01ba43b8 | 2254 | dp->d_ops->free_hdr_from_disk(&freehdr, free); |
cbc8adf8 | 2255 | |
1da177e4 LT |
2256 | /* |
2257 | * If there are used entries, there's nothing to do. | |
2258 | */ | |
cbc8adf8 | 2259 | if (freehdr.nused > 0) { |
1d9025e5 | 2260 | xfs_trans_brelse(tp, bp); |
1da177e4 LT |
2261 | *rvalp = 0; |
2262 | return 0; | |
2263 | } | |
2264 | /* | |
2265 | * Blow the block away. | |
2266 | */ | |
2998ab1d DC |
2267 | error = xfs_dir2_shrink_inode(args, |
2268 | xfs_dir2_da_to_db(args->geo, (xfs_dablk_t)fo), bp); | |
2269 | if (error) { | |
1da177e4 LT |
2270 | /* |
2271 | * Can't fail with ENOSPC since that only happens with no | |
2272 | * space reservation, when breaking up an extent into two | |
2273 | * pieces. This is the last block of an extent. | |
2274 | */ | |
2451337d | 2275 | ASSERT(error != -ENOSPC); |
1d9025e5 | 2276 | xfs_trans_brelse(tp, bp); |
1da177e4 LT |
2277 | return error; |
2278 | } | |
2279 | /* | |
2280 | * Return that we succeeded. | |
2281 | */ | |
2282 | *rvalp = 1; | |
2283 | return 0; | |
2284 | } |