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