Blame view
fs/xfs/xfs_dir2_block.c
35.5 KB
1da177e4c Linux-2.6.12-rc2 |
1 |
/* |
7b7187698 [XFS] Update lice... |
2 3 |
* Copyright (c) 2000-2003,2005 Silicon Graphics, Inc. * All Rights Reserved. |
1da177e4c Linux-2.6.12-rc2 |
4 |
* |
7b7187698 [XFS] Update lice... |
5 6 |
* This program is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License as |
1da177e4c Linux-2.6.12-rc2 |
7 8 |
* published by the Free Software Foundation. * |
7b7187698 [XFS] Update lice... |
9 10 11 12 |
* This program is distributed in the hope that it would be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. |
1da177e4c Linux-2.6.12-rc2 |
13 |
* |
7b7187698 [XFS] Update lice... |
14 15 16 |
* You should have received a copy of the GNU General Public License * along with this program; if not, write the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA |
1da177e4c Linux-2.6.12-rc2 |
17 |
*/ |
1da177e4c Linux-2.6.12-rc2 |
18 |
#include "xfs.h" |
a844f4510 [XFS] Remove xfs_... |
19 |
#include "xfs_fs.h" |
1da177e4c Linux-2.6.12-rc2 |
20 |
#include "xfs_types.h" |
1da177e4c Linux-2.6.12-rc2 |
21 |
#include "xfs_log.h" |
a844f4510 [XFS] Remove xfs_... |
22 |
#include "xfs_inum.h" |
1da177e4c Linux-2.6.12-rc2 |
23 24 |
#include "xfs_trans.h" #include "xfs_sb.h" |
da353b0d6 [XFS] Radix tree ... |
25 |
#include "xfs_ag.h" |
1da177e4c Linux-2.6.12-rc2 |
26 27 28 |
#include "xfs_dir2.h" #include "xfs_dmapi.h" #include "xfs_mount.h" |
a844f4510 [XFS] Remove xfs_... |
29 |
#include "xfs_da_btree.h" |
1da177e4c Linux-2.6.12-rc2 |
30 |
#include "xfs_bmap_btree.h" |
1da177e4c Linux-2.6.12-rc2 |
31 |
#include "xfs_dir2_sf.h" |
a844f4510 [XFS] Remove xfs_... |
32 |
#include "xfs_attr_sf.h" |
1da177e4c Linux-2.6.12-rc2 |
33 |
#include "xfs_dinode.h" |
1da177e4c Linux-2.6.12-rc2 |
34 |
#include "xfs_inode.h" |
a844f4510 [XFS] Remove xfs_... |
35 |
#include "xfs_inode_item.h" |
1da177e4c Linux-2.6.12-rc2 |
36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 |
#include "xfs_dir2_data.h" #include "xfs_dir2_leaf.h" #include "xfs_dir2_block.h" #include "xfs_dir2_trace.h" #include "xfs_error.h" /* * Local function prototypes. */ static void xfs_dir2_block_log_leaf(xfs_trans_t *tp, xfs_dabuf_t *bp, int first, int last); static void xfs_dir2_block_log_tail(xfs_trans_t *tp, xfs_dabuf_t *bp); static int xfs_dir2_block_lookup_int(xfs_da_args_t *args, xfs_dabuf_t **bpp, int *entno); static int xfs_dir2_block_sort(const void *a, const void *b); |
f6c2d1fa6 [XFS] Remove vers... |
51 52 53 54 55 56 57 58 59 60 61 |
static xfs_dahash_t xfs_dir_hash_dot, xfs_dir_hash_dotdot; /* * One-time startup routine called from xfs_init(). */ void xfs_dir_startup(void) { xfs_dir_hash_dot = xfs_da_hashname(".", 1); xfs_dir_hash_dotdot = xfs_da_hashname("..", 2); } |
1da177e4c Linux-2.6.12-rc2 |
62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 |
/* * Add an entry to a block directory. */ int /* error */ xfs_dir2_block_addname( xfs_da_args_t *args) /* directory op arguments */ { xfs_dir2_data_free_t *bf; /* bestfree table in block */ xfs_dir2_block_t *block; /* directory block structure */ xfs_dir2_leaf_entry_t *blp; /* block leaf entries */ xfs_dabuf_t *bp; /* buffer for block */ xfs_dir2_block_tail_t *btp; /* block tail */ int compact; /* need to compact leaf ents */ xfs_dir2_data_entry_t *dep; /* block data entry */ xfs_inode_t *dp; /* directory inode */ xfs_dir2_data_unused_t *dup; /* block unused entry */ int error; /* error return value */ xfs_dir2_data_unused_t *enddup=NULL; /* unused at end of data */ xfs_dahash_t hash; /* hash value of found entry */ int high; /* high index for binary srch */ int highstale; /* high stale index */ int lfloghigh=0; /* last final leaf to log */ int lfloglow=0; /* first final leaf to log */ int len; /* length of the new entry */ int low; /* low index for binary srch */ int lowstale; /* low stale index */ int mid=0; /* midpoint for binary srch */ xfs_mount_t *mp; /* filesystem mount point */ int needlog; /* need to log header */ int needscan; /* need to rescan freespace */ |
3d693c6ed [XFS] endianess a... |
92 |
__be16 *tagp; /* pointer to tag value */ |
1da177e4c Linux-2.6.12-rc2 |
93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 |
xfs_trans_t *tp; /* transaction structure */ xfs_dir2_trace_args("block_addname", args); dp = args->dp; tp = args->trans; mp = dp->i_mount; /* * Read the (one and only) directory block into dabuf bp. */ if ((error = xfs_da_read_buf(tp, dp, mp->m_dirdatablk, -1, &bp, XFS_DATA_FORK))) { return error; } ASSERT(bp != NULL); block = bp->data; /* * Check the magic number, corrupted if wrong. */ |
70e73f597 [XFS] endianess a... |
111 |
if (unlikely(be32_to_cpu(block->hdr.magic) != XFS_DIR2_BLOCK_MAGIC)) { |
1da177e4c Linux-2.6.12-rc2 |
112 113 114 115 116 |
XFS_CORRUPTION_ERROR("xfs_dir2_block_addname", XFS_ERRLEVEL_LOW, mp, block); xfs_da_brelse(tp, bp); return XFS_ERROR(EFSCORRUPTED); } |
bbaaf5380 [XFS] Reduce shou... |
117 |
len = xfs_dir2_data_entsize(args->namelen); |
1da177e4c Linux-2.6.12-rc2 |
118 119 120 121 |
/* * Set up pointers to parts of the block. */ bf = block->hdr.bestfree; |
bbaaf5380 [XFS] Reduce shou... |
122 123 |
btp = xfs_dir2_block_tail_p(mp, block); blp = xfs_dir2_block_leaf_p(btp); |
1da177e4c Linux-2.6.12-rc2 |
124 125 126 127 128 129 130 |
/* * No stale entries? Need space for entry and new leaf. */ if (!btp->stale) { /* * Tag just before the first leaf entry. */ |
3d693c6ed [XFS] endianess a... |
131 |
tagp = (__be16 *)blp - 1; |
1da177e4c Linux-2.6.12-rc2 |
132 133 134 |
/* * Data object just before the first leaf entry. */ |
3d693c6ed [XFS] endianess a... |
135 |
enddup = (xfs_dir2_data_unused_t *)((char *)block + be16_to_cpu(*tagp)); |
1da177e4c Linux-2.6.12-rc2 |
136 137 138 139 140 |
/* * If it's not free then can't do this add without cleaning up: * the space before the first leaf entry needs to be free so it * can be expanded to hold the pointer to the new entry. */ |
ad354eb34 [XFS] endianess a... |
141 |
if (be16_to_cpu(enddup->freetag) != XFS_DIR2_DATA_FREE_TAG) |
1da177e4c Linux-2.6.12-rc2 |
142 143 144 145 146 147 |
dup = enddup = NULL; /* * Check out the biggest freespace and see if it's the same one. */ else { dup = (xfs_dir2_data_unused_t *) |
70e73f597 [XFS] endianess a... |
148 |
((char *)block + be16_to_cpu(bf[0].offset)); |
1da177e4c Linux-2.6.12-rc2 |
149 150 151 152 153 |
if (dup == enddup) { /* * It is the biggest freespace, is it too small * to hold the new leaf too? */ |
ad354eb34 [XFS] endianess a... |
154 |
if (be16_to_cpu(dup->length) < len + (uint)sizeof(*blp)) { |
1da177e4c Linux-2.6.12-rc2 |
155 156 157 158 |
/* * Yes, we use the second-largest * entry instead if it works. */ |
70e73f597 [XFS] endianess a... |
159 |
if (be16_to_cpu(bf[1].length) >= len) |
1da177e4c Linux-2.6.12-rc2 |
160 161 |
dup = (xfs_dir2_data_unused_t *) ((char *)block + |
70e73f597 [XFS] endianess a... |
162 |
be16_to_cpu(bf[1].offset)); |
1da177e4c Linux-2.6.12-rc2 |
163 164 165 166 167 168 169 170 |
else dup = NULL; } } else { /* * Not the same free entry, * just check its length. */ |
ad354eb34 [XFS] endianess a... |
171 |
if (be16_to_cpu(dup->length) < len) { |
1da177e4c Linux-2.6.12-rc2 |
172 173 174 175 176 177 178 179 180 181 |
dup = NULL; } } } compact = 0; } /* * If there are stale entries we'll use one for the leaf. * Is the biggest entry enough to avoid compaction? */ |
70e73f597 [XFS] endianess a... |
182 |
else if (be16_to_cpu(bf[0].length) >= len) { |
1da177e4c Linux-2.6.12-rc2 |
183 |
dup = (xfs_dir2_data_unused_t *) |
70e73f597 [XFS] endianess a... |
184 |
((char *)block + be16_to_cpu(bf[0].offset)); |
1da177e4c Linux-2.6.12-rc2 |
185 186 187 188 189 190 191 192 193 |
compact = 0; } /* * Will need to compact to make this work. */ else { /* * Tag just before the first leaf entry. */ |
3d693c6ed [XFS] endianess a... |
194 |
tagp = (__be16 *)blp - 1; |
1da177e4c Linux-2.6.12-rc2 |
195 196 197 |
/* * Data object just before the first leaf entry. */ |
3d693c6ed [XFS] endianess a... |
198 |
dup = (xfs_dir2_data_unused_t *)((char *)block + be16_to_cpu(*tagp)); |
1da177e4c Linux-2.6.12-rc2 |
199 200 201 202 |
/* * If it's not free then the data will go where the * leaf data starts now, if it works at all. */ |
ad354eb34 [XFS] endianess a... |
203 |
if (be16_to_cpu(dup->freetag) == XFS_DIR2_DATA_FREE_TAG) { |
e922fffa4 [XFS] endianess a... |
204 |
if (be16_to_cpu(dup->length) + (be32_to_cpu(btp->stale) - 1) * |
1da177e4c Linux-2.6.12-rc2 |
205 206 |
(uint)sizeof(*blp) < len) dup = NULL; |
e922fffa4 [XFS] endianess a... |
207 |
} else if ((be32_to_cpu(btp->stale) - 1) * (uint)sizeof(*blp) < len) |
1da177e4c Linux-2.6.12-rc2 |
208 209 210 211 212 213 214 215 |
dup = NULL; else dup = (xfs_dir2_data_unused_t *)blp; compact = 1; } /* * If this isn't a real add, we're done with the buffer. */ |
6a178100a [XFS] Add op_flag... |
216 |
if (args->op_flags & XFS_DA_OP_JUSTCHECK) |
1da177e4c Linux-2.6.12-rc2 |
217 218 219 220 221 222 223 224 225 |
xfs_da_brelse(tp, bp); /* * If we don't have space for the new entry & leaf ... */ if (!dup) { /* * Not trying to actually do anything, or don't have * a space reservation: return no-space. */ |
6a178100a [XFS] Add op_flag... |
226 |
if ((args->op_flags & XFS_DA_OP_JUSTCHECK) || args->total == 0) |
1da177e4c Linux-2.6.12-rc2 |
227 228 229 230 231 232 233 234 235 236 237 238 239 240 |
return XFS_ERROR(ENOSPC); /* * Convert to the next larger format. * Then add the new entry in that format. */ error = xfs_dir2_block_to_leaf(args, bp); xfs_da_buf_done(bp); if (error) return error; return xfs_dir2_leaf_addname(args); } /* * Just checking, and it would work, so say so. */ |
6a178100a [XFS] Add op_flag... |
241 |
if (args->op_flags & XFS_DA_OP_JUSTCHECK) |
1da177e4c Linux-2.6.12-rc2 |
242 243 244 245 246 247 248 249 250 251 |
return 0; needlog = needscan = 0; /* * If need to compact the leaf entries, do it now. * Leave the highest-numbered stale entry stale. * XXX should be the one closest to mid but mid is not yet computed. */ if (compact) { int fromidx; /* source leaf index */ int toidx; /* target leaf index */ |
e922fffa4 [XFS] endianess a... |
252 |
for (fromidx = toidx = be32_to_cpu(btp->count) - 1, |
1da177e4c Linux-2.6.12-rc2 |
253 254 255 |
highstale = lfloghigh = -1; fromidx >= 0; fromidx--) { |
3c1f9c158 [XFS] endianess a... |
256 |
if (be32_to_cpu(blp[fromidx].address) == XFS_DIR2_NULL_DATAPTR) { |
1da177e4c Linux-2.6.12-rc2 |
257 258 259 260 261 262 263 264 265 266 267 268 |
if (highstale == -1) highstale = toidx; else { if (lfloghigh == -1) lfloghigh = toidx; continue; } } if (fromidx < toidx) blp[toidx] = blp[fromidx]; toidx--; } |
e922fffa4 [XFS] endianess a... |
269 270 |
lfloglow = toidx + 1 - (be32_to_cpu(btp->stale) - 1); lfloghigh -= be32_to_cpu(btp->stale) - 1; |
413d57c99 xfs: convert beX_... |
271 |
be32_add_cpu(&btp->count, -(be32_to_cpu(btp->stale) - 1)); |
1da177e4c Linux-2.6.12-rc2 |
272 273 |
xfs_dir2_data_make_free(tp, bp, (xfs_dir2_data_aoff_t)((char *)blp - (char *)block), |
e922fffa4 [XFS] endianess a... |
274 |
(xfs_dir2_data_aoff_t)((be32_to_cpu(btp->stale) - 1) * sizeof(*blp)), |
1da177e4c Linux-2.6.12-rc2 |
275 |
&needlog, &needscan); |
e922fffa4 [XFS] endianess a... |
276 277 |
blp += be32_to_cpu(btp->stale) - 1; btp->stale = cpu_to_be32(1); |
1da177e4c Linux-2.6.12-rc2 |
278 279 280 281 282 |
/* * If we now need to rebuild the bestfree map, do so. * This needs to happen before the next call to use_free. */ if (needscan) { |
ef497f8a1 [XFS] the "aendp"... |
283 |
xfs_dir2_data_freescan(mp, (xfs_dir2_data_t *)block, &needlog); |
1da177e4c Linux-2.6.12-rc2 |
284 285 286 287 288 289 290 |
needscan = 0; } } /* * Set leaf logging boundaries to impossible state. * For the no-stale case they're set explicitly. */ |
e922fffa4 [XFS] endianess a... |
291 292 |
else if (btp->stale) { lfloglow = be32_to_cpu(btp->count); |
1da177e4c Linux-2.6.12-rc2 |
293 294 295 296 297 |
lfloghigh = -1; } /* * Find the slot that's first lower than our hash value, -1 if none. */ |
e922fffa4 [XFS] endianess a... |
298 |
for (low = 0, high = be32_to_cpu(btp->count) - 1; low <= high; ) { |
1da177e4c Linux-2.6.12-rc2 |
299 |
mid = (low + high) >> 1; |
3c1f9c158 [XFS] endianess a... |
300 |
if ((hash = be32_to_cpu(blp[mid].hashval)) == args->hashval) |
1da177e4c Linux-2.6.12-rc2 |
301 302 303 304 305 306 |
break; if (hash < args->hashval) low = mid + 1; else high = mid - 1; } |
3c1f9c158 [XFS] endianess a... |
307 |
while (mid >= 0 && be32_to_cpu(blp[mid].hashval) >= args->hashval) { |
1da177e4c Linux-2.6.12-rc2 |
308 309 310 311 312 313 314 315 316 317 318 |
mid--; } /* * No stale entries, will use enddup space to hold new leaf. */ if (!btp->stale) { /* * Mark the space needed for the new leaf entry, now in use. */ xfs_dir2_data_use_free(tp, bp, enddup, (xfs_dir2_data_aoff_t) |
ad354eb34 [XFS] endianess a... |
319 |
((char *)enddup - (char *)block + be16_to_cpu(enddup->length) - |
1da177e4c Linux-2.6.12-rc2 |
320 321 322 323 324 325 |
sizeof(*blp)), (xfs_dir2_data_aoff_t)sizeof(*blp), &needlog, &needscan); /* * Update the tail (entry count). */ |
413d57c99 xfs: convert beX_... |
326 |
be32_add_cpu(&btp->count, 1); |
1da177e4c Linux-2.6.12-rc2 |
327 328 329 330 331 332 |
/* * If we now need to rebuild the bestfree map, do so. * This needs to happen before the next call to use_free. */ if (needscan) { xfs_dir2_data_freescan(mp, (xfs_dir2_data_t *)block, |
ef497f8a1 [XFS] the "aendp"... |
333 |
&needlog); |
1da177e4c Linux-2.6.12-rc2 |
334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 |
needscan = 0; } /* * Adjust pointer to the first leaf entry, we're about to move * the table up one to open up space for the new leaf entry. * Then adjust our index to match. */ blp--; mid++; if (mid) memmove(blp, &blp[1], mid * sizeof(*blp)); lfloglow = 0; lfloghigh = mid; } /* * Use a stale leaf for our new entry. */ else { for (lowstale = mid; lowstale >= 0 && |
3c1f9c158 [XFS] endianess a... |
354 |
be32_to_cpu(blp[lowstale].address) != XFS_DIR2_NULL_DATAPTR; |
1da177e4c Linux-2.6.12-rc2 |
355 356 357 |
lowstale--) continue; for (highstale = mid + 1; |
e922fffa4 [XFS] endianess a... |
358 |
highstale < be32_to_cpu(btp->count) && |
3c1f9c158 [XFS] endianess a... |
359 |
be32_to_cpu(blp[highstale].address) != XFS_DIR2_NULL_DATAPTR && |
1da177e4c Linux-2.6.12-rc2 |
360 361 362 363 364 365 366 |
(lowstale < 0 || mid - lowstale > highstale - mid); highstale++) continue; /* * Move entries toward the low-numbered stale entry. */ if (lowstale >= 0 && |
e922fffa4 [XFS] endianess a... |
367 |
(highstale == be32_to_cpu(btp->count) || |
1da177e4c Linux-2.6.12-rc2 |
368 369 370 371 372 373 374 375 376 377 378 |
mid - lowstale <= highstale - mid)) { if (mid - lowstale) memmove(&blp[lowstale], &blp[lowstale + 1], (mid - lowstale) * sizeof(*blp)); lfloglow = MIN(lowstale, lfloglow); lfloghigh = MAX(mid, lfloghigh); } /* * Move entries toward the high-numbered stale entry. */ else { |
e922fffa4 [XFS] endianess a... |
379 |
ASSERT(highstale < be32_to_cpu(btp->count)); |
1da177e4c Linux-2.6.12-rc2 |
380 381 382 383 384 385 386 |
mid++; if (highstale - mid) memmove(&blp[mid + 1], &blp[mid], (highstale - mid) * sizeof(*blp)); lfloglow = MIN(mid, lfloglow); lfloghigh = MAX(highstale, lfloghigh); } |
413d57c99 xfs: convert beX_... |
387 |
be32_add_cpu(&btp->stale, -1); |
1da177e4c Linux-2.6.12-rc2 |
388 389 390 391 392 393 394 395 |
} /* * Point to the new data entry. */ dep = (xfs_dir2_data_entry_t *)dup; /* * Fill in the leaf entry. */ |
3c1f9c158 [XFS] endianess a... |
396 |
blp[mid].hashval = cpu_to_be32(args->hashval); |
bbaaf5380 [XFS] Reduce shou... |
397 |
blp[mid].address = cpu_to_be32(xfs_dir2_byte_to_dataptr(mp, |
3c1f9c158 [XFS] endianess a... |
398 |
(char *)dep - (char *)block)); |
1da177e4c Linux-2.6.12-rc2 |
399 400 401 402 403 404 405 406 407 408 |
xfs_dir2_block_log_leaf(tp, bp, lfloglow, lfloghigh); /* * Mark space for the data entry used. */ xfs_dir2_data_use_free(tp, bp, dup, (xfs_dir2_data_aoff_t)((char *)dup - (char *)block), (xfs_dir2_data_aoff_t)len, &needlog, &needscan); /* * Create the new data entry. */ |
ff9901c1e [XFS] endianess a... |
409 |
dep->inumber = cpu_to_be64(args->inumber); |
1da177e4c Linux-2.6.12-rc2 |
410 411 |
dep->namelen = args->namelen; memcpy(dep->name, args->name, args->namelen); |
bbaaf5380 [XFS] Reduce shou... |
412 |
tagp = xfs_dir2_data_entry_tag_p(dep); |
3d693c6ed [XFS] endianess a... |
413 |
*tagp = cpu_to_be16((char *)dep - (char *)block); |
1da177e4c Linux-2.6.12-rc2 |
414 415 416 417 |
/* * Clean up the bestfree array and log the header, tail, and entry. */ if (needscan) |
ef497f8a1 [XFS] the "aendp"... |
418 |
xfs_dir2_data_freescan(mp, (xfs_dir2_data_t *)block, &needlog); |
1da177e4c Linux-2.6.12-rc2 |
419 420 421 422 423 424 425 426 427 428 429 430 431 432 |
if (needlog) xfs_dir2_data_log_header(tp, bp); xfs_dir2_block_log_tail(tp, bp); xfs_dir2_data_log_entry(tp, bp, dep); xfs_dir2_data_check(dp, bp); xfs_da_buf_done(bp); return 0; } /* * Readdir for block directories. */ int /* error */ xfs_dir2_block_getdents( |
1da177e4c Linux-2.6.12-rc2 |
433 |
xfs_inode_t *dp, /* incore inode */ |
051e7cd44 [XFS] use filldir... |
434 435 436 |
void *dirent, xfs_off_t *offset, filldir_t filldir) |
1da177e4c Linux-2.6.12-rc2 |
437 438 439 440 441 442 443 444 445 |
{ xfs_dir2_block_t *block; /* directory block structure */ xfs_dabuf_t *bp; /* buffer for block */ xfs_dir2_block_tail_t *btp; /* block tail */ xfs_dir2_data_entry_t *dep; /* block data entry */ xfs_dir2_data_unused_t *dup; /* block unused entry */ char *endptr; /* end of the data entries */ int error; /* error return value */ xfs_mount_t *mp; /* filesystem mount point */ |
1da177e4c Linux-2.6.12-rc2 |
446 447 |
char *ptr; /* current data entry */ int wantoff; /* starting block offset */ |
051e7cd44 [XFS] use filldir... |
448 449 |
xfs_ino_t ino; xfs_off_t cook; |
1da177e4c Linux-2.6.12-rc2 |
450 451 452 453 454 |
mp = dp->i_mount; /* * If the block number in the offset is out of range, we're done. */ |
051e7cd44 [XFS] use filldir... |
455 |
if (xfs_dir2_dataptr_to_db(mp, *offset) > mp->m_dirdatablk) { |
1da177e4c Linux-2.6.12-rc2 |
456 457 458 459 460 |
return 0; } /* * Can't read the block, give up, else get dabuf in bp. */ |
051e7cd44 [XFS] use filldir... |
461 462 463 |
error = xfs_da_read_buf(NULL, dp, mp->m_dirdatablk, -1, &bp, XFS_DATA_FORK); if (error) |
1da177e4c Linux-2.6.12-rc2 |
464 |
return error; |
051e7cd44 [XFS] use filldir... |
465 |
|
1da177e4c Linux-2.6.12-rc2 |
466 467 468 469 470 |
ASSERT(bp != NULL); /* * Extract the byte offset we start at from the seek pointer. * We'll skip entries before this. */ |
051e7cd44 [XFS] use filldir... |
471 |
wantoff = xfs_dir2_dataptr_to_off(mp, *offset); |
1da177e4c Linux-2.6.12-rc2 |
472 473 474 475 476 |
block = bp->data; xfs_dir2_data_check(dp, bp); /* * Set up values for the loop. */ |
bbaaf5380 [XFS] Reduce shou... |
477 |
btp = xfs_dir2_block_tail_p(mp, block); |
1da177e4c Linux-2.6.12-rc2 |
478 |
ptr = (char *)block->u; |
bbaaf5380 [XFS] Reduce shou... |
479 |
endptr = (char *)xfs_dir2_block_leaf_p(btp); |
051e7cd44 [XFS] use filldir... |
480 |
|
1da177e4c Linux-2.6.12-rc2 |
481 482 483 484 485 486 487 488 489 |
/* * Loop over the data portion of the block. * Each object is a real entry (dep) or an unused one (dup). */ while (ptr < endptr) { dup = (xfs_dir2_data_unused_t *)ptr; /* * Unused, skip it. */ |
ad354eb34 [XFS] endianess a... |
490 491 |
if (be16_to_cpu(dup->freetag) == XFS_DIR2_DATA_FREE_TAG) { ptr += be16_to_cpu(dup->length); |
1da177e4c Linux-2.6.12-rc2 |
492 493 494 495 496 497 498 499 |
continue; } dep = (xfs_dir2_data_entry_t *)ptr; /* * Bump pointer for the next iteration. */ |
bbaaf5380 [XFS] Reduce shou... |
500 |
ptr += xfs_dir2_data_entsize(dep->namelen); |
1da177e4c Linux-2.6.12-rc2 |
501 502 503 504 505 |
/* * The entry is before the desired starting point, skip it. */ if ((char *)dep - (char *)block < wantoff) continue; |
1da177e4c Linux-2.6.12-rc2 |
506 |
|
051e7cd44 [XFS] use filldir... |
507 |
cook = xfs_dir2_db_off_to_dataptr(mp, mp->m_dirdatablk, |
041388b54 [XFS] Put the cor... |
508 |
(char *)dep - (char *)block); |
051e7cd44 [XFS] use filldir... |
509 |
ino = be64_to_cpu(dep->inumber); |
1da177e4c Linux-2.6.12-rc2 |
510 |
#if XFS_BIG_INUMS |
051e7cd44 [XFS] use filldir... |
511 |
ino += mp->m_inoadd; |
1da177e4c Linux-2.6.12-rc2 |
512 |
#endif |
1da177e4c Linux-2.6.12-rc2 |
513 514 515 516 |
/* * If it didn't fit, set the final offset to here & return. */ |
154403197 [XFS] truncate re... |
517 |
if (filldir(dirent, dep->name, dep->namelen, cook & 0x7fffffff, |
051e7cd44 [XFS] use filldir... |
518 |
ino, DT_UNKNOWN)) { |
154403197 [XFS] truncate re... |
519 |
*offset = cook & 0x7fffffff; |
051e7cd44 [XFS] use filldir... |
520 521 |
xfs_da_brelse(NULL, bp); return 0; |
1da177e4c Linux-2.6.12-rc2 |
522 523 524 525 526 |
} } /* * Reached the end of the block. |
c41564b5a [XFS] We really s... |
527 |
* Set the offset to a non-existent block 1 and return. |
1da177e4c Linux-2.6.12-rc2 |
528 |
*/ |
154403197 [XFS] truncate re... |
529 530 |
*offset = xfs_dir2_db_off_to_dataptr(mp, mp->m_dirdatablk + 1, 0) & 0x7fffffff; |
051e7cd44 [XFS] use filldir... |
531 |
xfs_da_brelse(NULL, bp); |
1da177e4c Linux-2.6.12-rc2 |
532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 |
return 0; } /* * Log leaf entries from the block. */ static void xfs_dir2_block_log_leaf( xfs_trans_t *tp, /* transaction structure */ xfs_dabuf_t *bp, /* block buffer */ int first, /* index of first logged leaf */ int last) /* index of last logged leaf */ { xfs_dir2_block_t *block; /* directory block structure */ xfs_dir2_leaf_entry_t *blp; /* block leaf entries */ xfs_dir2_block_tail_t *btp; /* block tail */ xfs_mount_t *mp; /* filesystem mount point */ mp = tp->t_mountp; block = bp->data; |
bbaaf5380 [XFS] Reduce shou... |
552 553 |
btp = xfs_dir2_block_tail_p(mp, block); blp = xfs_dir2_block_leaf_p(btp); |
1da177e4c Linux-2.6.12-rc2 |
554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 |
xfs_da_log_buf(tp, bp, (uint)((char *)&blp[first] - (char *)block), (uint)((char *)&blp[last + 1] - (char *)block - 1)); } /* * Log the block tail. */ static void xfs_dir2_block_log_tail( xfs_trans_t *tp, /* transaction structure */ xfs_dabuf_t *bp) /* block buffer */ { xfs_dir2_block_t *block; /* directory block structure */ xfs_dir2_block_tail_t *btp; /* block tail */ xfs_mount_t *mp; /* filesystem mount point */ mp = tp->t_mountp; block = bp->data; |
bbaaf5380 [XFS] Reduce shou... |
572 |
btp = xfs_dir2_block_tail_p(mp, block); |
1da177e4c Linux-2.6.12-rc2 |
573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 |
xfs_da_log_buf(tp, bp, (uint)((char *)btp - (char *)block), (uint)((char *)(btp + 1) - (char *)block - 1)); } /* * Look up an entry in the block. This is the external routine, * xfs_dir2_block_lookup_int does the real work. */ int /* error */ xfs_dir2_block_lookup( xfs_da_args_t *args) /* dir lookup arguments */ { xfs_dir2_block_t *block; /* block structure */ xfs_dir2_leaf_entry_t *blp; /* block leaf entries */ xfs_dabuf_t *bp; /* block buffer */ xfs_dir2_block_tail_t *btp; /* block tail */ xfs_dir2_data_entry_t *dep; /* block data entry */ xfs_inode_t *dp; /* incore inode */ int ent; /* entry index */ int error; /* error return value */ xfs_mount_t *mp; /* filesystem mount point */ xfs_dir2_trace_args("block_lookup", args); /* * Get the buffer, look up the entry. * If not found (ENOENT) then return, have no buffer. */ if ((error = xfs_dir2_block_lookup_int(args, &bp, &ent))) return error; dp = args->dp; mp = dp->i_mount; block = bp->data; xfs_dir2_data_check(dp, bp); |
bbaaf5380 [XFS] Reduce shou... |
606 607 |
btp = xfs_dir2_block_tail_p(mp, block); blp = xfs_dir2_block_leaf_p(btp); |
1da177e4c Linux-2.6.12-rc2 |
608 609 610 |
/* * Get the offset from the leaf entry, to point to the data. */ |
384f3ced0 [XFS] Return case... |
611 612 |
dep = (xfs_dir2_data_entry_t *)((char *)block + xfs_dir2_dataptr_to_off(mp, be32_to_cpu(blp[ent].address))); |
1da177e4c Linux-2.6.12-rc2 |
613 |
/* |
384f3ced0 [XFS] Return case... |
614 |
* Fill in inode number, CI name if appropriate, release the block. |
1da177e4c Linux-2.6.12-rc2 |
615 |
*/ |
ff9901c1e [XFS] endianess a... |
616 |
args->inumber = be64_to_cpu(dep->inumber); |
384f3ced0 [XFS] Return case... |
617 |
error = xfs_dir_cilookup_result(args, dep->name, dep->namelen); |
1da177e4c Linux-2.6.12-rc2 |
618 |
xfs_da_brelse(args->trans, bp); |
384f3ced0 [XFS] Return case... |
619 |
return XFS_ERROR(error); |
1da177e4c Linux-2.6.12-rc2 |
620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 |
} /* * Internal block lookup routine. */ static int /* error */ xfs_dir2_block_lookup_int( xfs_da_args_t *args, /* dir lookup arguments */ xfs_dabuf_t **bpp, /* returned block buffer */ int *entno) /* returned entry number */ { xfs_dir2_dataptr_t addr; /* data entry address */ xfs_dir2_block_t *block; /* block structure */ xfs_dir2_leaf_entry_t *blp; /* block leaf entries */ xfs_dabuf_t *bp; /* block buffer */ xfs_dir2_block_tail_t *btp; /* block tail */ xfs_dir2_data_entry_t *dep; /* block data entry */ xfs_inode_t *dp; /* incore inode */ int error; /* error return value */ xfs_dahash_t hash; /* found hash value */ int high; /* binary search high index */ int low; /* binary search low index */ int mid; /* binary search current idx */ xfs_mount_t *mp; /* filesystem mount point */ xfs_trans_t *tp; /* transaction pointer */ |
5163f95a0 [XFS] Name operat... |
645 |
enum xfs_dacmp cmp; /* comparison result */ |
1da177e4c Linux-2.6.12-rc2 |
646 647 648 649 650 651 652 653 654 655 656 657 658 659 |
dp = args->dp; tp = args->trans; mp = dp->i_mount; /* * Read the buffer, return error if we can't get it. */ if ((error = xfs_da_read_buf(tp, dp, mp->m_dirdatablk, -1, &bp, XFS_DATA_FORK))) { return error; } ASSERT(bp != NULL); block = bp->data; xfs_dir2_data_check(dp, bp); |
bbaaf5380 [XFS] Reduce shou... |
660 661 |
btp = xfs_dir2_block_tail_p(mp, block); blp = xfs_dir2_block_leaf_p(btp); |
1da177e4c Linux-2.6.12-rc2 |
662 663 664 665 |
/* * Loop doing a binary search for our hash value. * Find our entry, ENOENT if it's not there. */ |
e922fffa4 [XFS] endianess a... |
666 |
for (low = 0, high = be32_to_cpu(btp->count) - 1; ; ) { |
1da177e4c Linux-2.6.12-rc2 |
667 668 |
ASSERT(low <= high); mid = (low + high) >> 1; |
3c1f9c158 [XFS] endianess a... |
669 |
if ((hash = be32_to_cpu(blp[mid].hashval)) == args->hashval) |
1da177e4c Linux-2.6.12-rc2 |
670 671 672 673 674 675 |
break; if (hash < args->hashval) low = mid + 1; else high = mid - 1; if (low > high) { |
6a178100a [XFS] Add op_flag... |
676 |
ASSERT(args->op_flags & XFS_DA_OP_OKNOENT); |
1da177e4c Linux-2.6.12-rc2 |
677 678 679 680 681 682 683 |
xfs_da_brelse(tp, bp); return XFS_ERROR(ENOENT); } } /* * Back up to the first one with the right hash value. */ |
3c1f9c158 [XFS] endianess a... |
684 |
while (mid > 0 && be32_to_cpu(blp[mid - 1].hashval) == args->hashval) { |
1da177e4c Linux-2.6.12-rc2 |
685 686 687 688 689 690 691 |
mid--; } /* * Now loop forward through all the entries with the * right hash value looking for our name. */ do { |
3c1f9c158 [XFS] endianess a... |
692 |
if ((addr = be32_to_cpu(blp[mid].address)) == XFS_DIR2_NULL_DATAPTR) |
1da177e4c Linux-2.6.12-rc2 |
693 694 695 696 697 |
continue; /* * Get pointer to the entry from the leaf. */ dep = (xfs_dir2_data_entry_t *) |
bbaaf5380 [XFS] Reduce shou... |
698 |
((char *)block + xfs_dir2_dataptr_to_off(mp, addr)); |
1da177e4c Linux-2.6.12-rc2 |
699 |
/* |
5163f95a0 [XFS] Name operat... |
700 701 702 |
* Compare name and if it's an exact match, return the index * and buffer. If it's the first case-insensitive match, store * the index and buffer and continue looking for an exact match. |
1da177e4c Linux-2.6.12-rc2 |
703 |
*/ |
5163f95a0 [XFS] Name operat... |
704 705 706 |
cmp = mp->m_dirnameops->compname(args, dep->name, dep->namelen); if (cmp != XFS_CMP_DIFFERENT && cmp != args->cmpresult) { args->cmpresult = cmp; |
1da177e4c Linux-2.6.12-rc2 |
707 708 |
*bpp = bp; *entno = mid; |
5163f95a0 [XFS] Name operat... |
709 710 |
if (cmp == XFS_CMP_EXACT) return 0; |
1da177e4c Linux-2.6.12-rc2 |
711 |
} |
5163f95a0 [XFS] Name operat... |
712 713 |
} while (++mid < be32_to_cpu(btp->count) && be32_to_cpu(blp[mid].hashval) == hash); |
6a178100a [XFS] Add op_flag... |
714 |
ASSERT(args->op_flags & XFS_DA_OP_OKNOENT); |
5163f95a0 [XFS] Name operat... |
715 716 717 718 719 720 |
/* * Here, we can only be doing a lookup (not a rename or replace). * If a case-insensitive match was found earlier, return success. */ if (args->cmpresult == XFS_CMP_CASE) return 0; |
1da177e4c Linux-2.6.12-rc2 |
721 722 723 |
/* * No match, release the buffer and return ENOENT. */ |
1da177e4c Linux-2.6.12-rc2 |
724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 |
xfs_da_brelse(tp, bp); return XFS_ERROR(ENOENT); } /* * Remove an entry from a block format directory. * If that makes the block small enough to fit in shortform, transform it. */ int /* error */ xfs_dir2_block_removename( xfs_da_args_t *args) /* directory operation args */ { xfs_dir2_block_t *block; /* block structure */ xfs_dir2_leaf_entry_t *blp; /* block leaf pointer */ xfs_dabuf_t *bp; /* block buffer */ xfs_dir2_block_tail_t *btp; /* block tail */ xfs_dir2_data_entry_t *dep; /* block data entry */ xfs_inode_t *dp; /* incore inode */ int ent; /* block leaf entry index */ int error; /* error return value */ xfs_mount_t *mp; /* filesystem mount point */ int needlog; /* need to log block header */ int needscan; /* need to fixup bestfree */ xfs_dir2_sf_hdr_t sfh; /* shortform header */ int size; /* shortform size */ xfs_trans_t *tp; /* transaction pointer */ xfs_dir2_trace_args("block_removename", args); /* * Look up the entry in the block. Gets the buffer and entry index. * It will always be there, the vnodeops level does a lookup first. */ if ((error = xfs_dir2_block_lookup_int(args, &bp, &ent))) { return error; } dp = args->dp; tp = args->trans; mp = dp->i_mount; block = bp->data; |
bbaaf5380 [XFS] Reduce shou... |
763 764 |
btp = xfs_dir2_block_tail_p(mp, block); blp = xfs_dir2_block_leaf_p(btp); |
1da177e4c Linux-2.6.12-rc2 |
765 766 767 768 |
/* * Point to the data entry using the leaf entry. */ dep = (xfs_dir2_data_entry_t *) |
bbaaf5380 [XFS] Reduce shou... |
769 |
((char *)block + xfs_dir2_dataptr_to_off(mp, be32_to_cpu(blp[ent].address))); |
1da177e4c Linux-2.6.12-rc2 |
770 771 772 773 774 775 |
/* * Mark the data entry's space free. */ needlog = needscan = 0; xfs_dir2_data_make_free(tp, bp, (xfs_dir2_data_aoff_t)((char *)dep - (char *)block), |
bbaaf5380 [XFS] Reduce shou... |
776 |
xfs_dir2_data_entsize(dep->namelen), &needlog, &needscan); |
1da177e4c Linux-2.6.12-rc2 |
777 778 779 |
/* * Fix up the block tail. */ |
413d57c99 xfs: convert beX_... |
780 |
be32_add_cpu(&btp->stale, 1); |
1da177e4c Linux-2.6.12-rc2 |
781 782 783 784 |
xfs_dir2_block_log_tail(tp, bp); /* * Remove the leaf entry by marking it stale. */ |
3c1f9c158 [XFS] endianess a... |
785 |
blp[ent].address = cpu_to_be32(XFS_DIR2_NULL_DATAPTR); |
1da177e4c Linux-2.6.12-rc2 |
786 787 788 789 790 |
xfs_dir2_block_log_leaf(tp, bp, ent, ent); /* * Fix up bestfree, log the header if necessary. */ if (needscan) |
ef497f8a1 [XFS] the "aendp"... |
791 |
xfs_dir2_data_freescan(mp, (xfs_dir2_data_t *)block, &needlog); |
1da177e4c Linux-2.6.12-rc2 |
792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 |
if (needlog) xfs_dir2_data_log_header(tp, bp); xfs_dir2_data_check(dp, bp); /* * See if the size as a shortform is good enough. */ if ((size = xfs_dir2_block_sfsize(dp, block, &sfh)) > XFS_IFORK_DSIZE(dp)) { xfs_da_buf_done(bp); return 0; } /* * If it works, do the conversion. */ return xfs_dir2_block_to_sf(args, bp, size, &sfh); } /* * Replace an entry in a V2 block directory. * Change the inode number to the new value. */ int /* error */ xfs_dir2_block_replace( xfs_da_args_t *args) /* directory operation args */ { xfs_dir2_block_t *block; /* block structure */ xfs_dir2_leaf_entry_t *blp; /* block leaf entries */ xfs_dabuf_t *bp; /* block buffer */ xfs_dir2_block_tail_t *btp; /* block tail */ xfs_dir2_data_entry_t *dep; /* block data entry */ xfs_inode_t *dp; /* incore inode */ int ent; /* leaf entry index */ int error; /* error return value */ xfs_mount_t *mp; /* filesystem mount point */ xfs_dir2_trace_args("block_replace", args); /* * Lookup the entry in the directory. Get buffer and entry index. * This will always succeed since the caller has already done a lookup. */ if ((error = xfs_dir2_block_lookup_int(args, &bp, &ent))) { return error; } dp = args->dp; mp = dp->i_mount; block = bp->data; |
bbaaf5380 [XFS] Reduce shou... |
838 839 |
btp = xfs_dir2_block_tail_p(mp, block); blp = xfs_dir2_block_leaf_p(btp); |
1da177e4c Linux-2.6.12-rc2 |
840 841 842 843 |
/* * Point to the data entry we need to change. */ dep = (xfs_dir2_data_entry_t *) |
bbaaf5380 [XFS] Reduce shou... |
844 |
((char *)block + xfs_dir2_dataptr_to_off(mp, be32_to_cpu(blp[ent].address))); |
ff9901c1e [XFS] endianess a... |
845 |
ASSERT(be64_to_cpu(dep->inumber) != args->inumber); |
1da177e4c Linux-2.6.12-rc2 |
846 847 848 |
/* * Change the inode number to the new value. */ |
ff9901c1e [XFS] endianess a... |
849 |
dep->inumber = cpu_to_be64(args->inumber); |
1da177e4c Linux-2.6.12-rc2 |
850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 |
xfs_dir2_data_log_entry(args->trans, bp, dep); xfs_dir2_data_check(dp, bp); xfs_da_buf_done(bp); return 0; } /* * Qsort comparison routine for the block leaf entries. */ static int /* sort order */ xfs_dir2_block_sort( const void *a, /* first leaf entry */ const void *b) /* second leaf entry */ { const xfs_dir2_leaf_entry_t *la; /* first leaf entry */ const xfs_dir2_leaf_entry_t *lb; /* second leaf entry */ la = a; lb = b; |
3c1f9c158 [XFS] endianess a... |
869 870 |
return be32_to_cpu(la->hashval) < be32_to_cpu(lb->hashval) ? -1 : (be32_to_cpu(la->hashval) > be32_to_cpu(lb->hashval) ? 1 : 0); |
1da177e4c Linux-2.6.12-rc2 |
871 872 873 874 875 876 877 878 879 880 881 |
} /* * Convert a V2 leaf directory to a V2 block directory if possible. */ int /* error */ xfs_dir2_leaf_to_block( xfs_da_args_t *args, /* operation arguments */ xfs_dabuf_t *lbp, /* leaf buffer */ xfs_dabuf_t *dbp) /* data buffer */ { |
68b3a1024 [XFS] endianess a... |
882 |
__be16 *bestsp; /* leaf bests table */ |
1da177e4c Linux-2.6.12-rc2 |
883 884 885 886 887 888 889 890 891 892 893 894 895 896 |
xfs_dir2_block_t *block; /* block structure */ xfs_dir2_block_tail_t *btp; /* block tail */ xfs_inode_t *dp; /* incore directory inode */ xfs_dir2_data_unused_t *dup; /* unused data entry */ int error; /* error return value */ int from; /* leaf from index */ xfs_dir2_leaf_t *leaf; /* leaf structure */ xfs_dir2_leaf_entry_t *lep; /* leaf entry */ xfs_dir2_leaf_tail_t *ltp; /* leaf tail structure */ xfs_mount_t *mp; /* file system mount point */ int needlog; /* need to log data header */ int needscan; /* need to scan for bestfree */ xfs_dir2_sf_hdr_t sfh; /* shortform header */ int size; /* bytes used */ |
3d693c6ed [XFS] endianess a... |
897 |
__be16 *tagp; /* end of entry (tag) */ |
1da177e4c Linux-2.6.12-rc2 |
898 899 900 901 902 903 904 905 |
int to; /* block/leaf to index */ xfs_trans_t *tp; /* transaction pointer */ xfs_dir2_trace_args_bb("leaf_to_block", args, lbp, dbp); dp = args->dp; tp = args->trans; mp = dp->i_mount; leaf = lbp->data; |
89da05442 [XFS] endianess a... |
906 |
ASSERT(be16_to_cpu(leaf->hdr.info.magic) == XFS_DIR2_LEAF1_MAGIC); |
bbaaf5380 [XFS] Reduce shou... |
907 |
ltp = xfs_dir2_leaf_tail_p(mp, leaf); |
1da177e4c Linux-2.6.12-rc2 |
908 909 910 911 912 913 914 |
/* * If there are data blocks other than the first one, take this * opportunity to remove trailing empty data blocks that may have * been left behind during no-space-reservation operations. * These will show up in the leaf bests table. */ while (dp->i_d.di_size > mp->m_dirblksize) { |
bbaaf5380 [XFS] Reduce shou... |
915 |
bestsp = xfs_dir2_leaf_bests_p(ltp); |
afbcb3f91 [XFS] endianess a... |
916 |
if (be16_to_cpu(bestsp[be32_to_cpu(ltp->bestcount) - 1]) == |
1da177e4c Linux-2.6.12-rc2 |
917 918 919 |
mp->m_dirblksize - (uint)sizeof(block->hdr)) { if ((error = xfs_dir2_leaf_trim_data(args, lbp, |
afbcb3f91 [XFS] endianess a... |
920 |
(xfs_dir2_db_t)(be32_to_cpu(ltp->bestcount) - 1)))) |
1da177e4c Linux-2.6.12-rc2 |
921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 |
goto out; } else { error = 0; goto out; } } /* * Read the data block if we don't already have it, give up if it fails. */ if (dbp == NULL && (error = xfs_da_read_buf(tp, dp, mp->m_dirdatablk, -1, &dbp, XFS_DATA_FORK))) { goto out; } block = dbp->data; |
70e73f597 [XFS] endianess a... |
936 |
ASSERT(be32_to_cpu(block->hdr.magic) == XFS_DIR2_DATA_MAGIC); |
1da177e4c Linux-2.6.12-rc2 |
937 938 939 940 |
/* * Size of the "leaf" area in the block. */ size = (uint)sizeof(block->tail) + |
a818e5de7 [XFS] endianess a... |
941 |
(uint)sizeof(*lep) * (be16_to_cpu(leaf->hdr.count) - be16_to_cpu(leaf->hdr.stale)); |
1da177e4c Linux-2.6.12-rc2 |
942 943 944 |
/* * Look at the last data entry. */ |
3d693c6ed [XFS] endianess a... |
945 946 |
tagp = (__be16 *)((char *)block + mp->m_dirblksize) - 1; dup = (xfs_dir2_data_unused_t *)((char *)block + be16_to_cpu(*tagp)); |
1da177e4c Linux-2.6.12-rc2 |
947 948 949 |
/* * If it's not free or is too short we can't do it. */ |
ad354eb34 [XFS] endianess a... |
950 951 |
if (be16_to_cpu(dup->freetag) != XFS_DIR2_DATA_FREE_TAG || be16_to_cpu(dup->length) < size) { |
1da177e4c Linux-2.6.12-rc2 |
952 953 954 955 956 957 |
error = 0; goto out; } /* * Start converting it to block form. */ |
70e73f597 [XFS] endianess a... |
958 |
block->hdr.magic = cpu_to_be32(XFS_DIR2_BLOCK_MAGIC); |
1da177e4c Linux-2.6.12-rc2 |
959 960 961 962 963 964 965 966 967 968 |
needlog = 1; needscan = 0; /* * Use up the space at the end of the block (blp/btp). */ xfs_dir2_data_use_free(tp, dbp, dup, mp->m_dirblksize - size, size, &needlog, &needscan); /* * Initialize the block tail. */ |
bbaaf5380 [XFS] Reduce shou... |
969 |
btp = xfs_dir2_block_tail_p(mp, block); |
a818e5de7 [XFS] endianess a... |
970 |
btp->count = cpu_to_be32(be16_to_cpu(leaf->hdr.count) - be16_to_cpu(leaf->hdr.stale)); |
1da177e4c Linux-2.6.12-rc2 |
971 972 973 974 975 |
btp->stale = 0; xfs_dir2_block_log_tail(tp, dbp); /* * Initialize the block leaf area. We compact out stale entries. */ |
bbaaf5380 [XFS] Reduce shou... |
976 |
lep = xfs_dir2_block_leaf_p(btp); |
a818e5de7 [XFS] endianess a... |
977 |
for (from = to = 0; from < be16_to_cpu(leaf->hdr.count); from++) { |
3c1f9c158 [XFS] endianess a... |
978 |
if (be32_to_cpu(leaf->ents[from].address) == XFS_DIR2_NULL_DATAPTR) |
1da177e4c Linux-2.6.12-rc2 |
979 980 981 |
continue; lep[to++] = leaf->ents[from]; } |
e922fffa4 [XFS] endianess a... |
982 983 |
ASSERT(to == be32_to_cpu(btp->count)); xfs_dir2_block_log_leaf(tp, dbp, 0, be32_to_cpu(btp->count) - 1); |
1da177e4c Linux-2.6.12-rc2 |
984 985 986 987 |
/* * Scan the bestfree if we need it and log the data block header. */ if (needscan) |
ef497f8a1 [XFS] the "aendp"... |
988 |
xfs_dir2_data_freescan(mp, (xfs_dir2_data_t *)block, &needlog); |
1da177e4c Linux-2.6.12-rc2 |
989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 |
if (needlog) xfs_dir2_data_log_header(tp, dbp); /* * Pitch the old leaf block. */ error = xfs_da_shrink_inode(args, mp->m_dirleafblk, lbp); lbp = NULL; if (error) { goto out; } /* * Now see if the resulting block can be shrunken to shortform. */ if ((size = xfs_dir2_block_sfsize(dp, block, &sfh)) > XFS_IFORK_DSIZE(dp)) { error = 0; goto out; } return xfs_dir2_block_to_sf(args, dbp, size, &sfh); out: if (lbp) xfs_da_buf_done(lbp); if (dbp) xfs_da_buf_done(dbp); return error; } /* * Convert the shortform directory to block form. */ int /* error */ xfs_dir2_sf_to_block( xfs_da_args_t *args) /* operation arguments */ { xfs_dir2_db_t blkno; /* dir-relative block # (0) */ xfs_dir2_block_t *block; /* block structure */ xfs_dir2_leaf_entry_t *blp; /* block leaf entries */ xfs_dabuf_t *bp; /* block buffer */ xfs_dir2_block_tail_t *btp; /* block tail pointer */ char *buf; /* sf buffer */ int buf_len; xfs_dir2_data_entry_t *dep; /* data entry pointer */ xfs_inode_t *dp; /* incore directory inode */ int dummy; /* trash */ xfs_dir2_data_unused_t *dup; /* unused entry pointer */ int endoffset; /* end of data objects */ int error; /* error return value */ int i; /* index */ xfs_mount_t *mp; /* filesystem mount point */ int needlog; /* need to log block header */ int needscan; /* need to scan block freespc */ int newoffset; /* offset from current entry */ int offset; /* target block offset */ xfs_dir2_sf_entry_t *sfep; /* sf entry pointer */ xfs_dir2_sf_t *sfp; /* shortform structure */ |
3d693c6ed [XFS] endianess a... |
1044 |
__be16 *tagp; /* end of data entry */ |
1da177e4c Linux-2.6.12-rc2 |
1045 |
xfs_trans_t *tp; /* transaction pointer */ |
5163f95a0 [XFS] Name operat... |
1046 |
struct xfs_name name; |
1da177e4c Linux-2.6.12-rc2 |
1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 |
xfs_dir2_trace_args("sf_to_block", args); dp = args->dp; tp = args->trans; mp = dp->i_mount; ASSERT(dp->i_df.if_flags & XFS_IFINLINE); /* * Bomb out if the shortform directory is way too short. */ if (dp->i_d.di_size < offsetof(xfs_dir2_sf_hdr_t, parent)) { ASSERT(XFS_FORCED_SHUTDOWN(mp)); return XFS_ERROR(EIO); } ASSERT(dp->i_df.if_bytes == dp->i_d.di_size); ASSERT(dp->i_df.if_u1.if_data != NULL); sfp = (xfs_dir2_sf_t *)dp->i_df.if_u1.if_data; |
bbaaf5380 [XFS] Reduce shou... |
1063 |
ASSERT(dp->i_d.di_size >= xfs_dir2_sf_hdr_size(sfp->hdr.i8count)); |
1da177e4c Linux-2.6.12-rc2 |
1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 |
/* * Copy the directory into the stack buffer. * Then pitch the incore inode data so we can make extents. */ buf_len = dp->i_df.if_bytes; buf = kmem_alloc(dp->i_df.if_bytes, KM_SLEEP); memcpy(buf, sfp, dp->i_df.if_bytes); xfs_idata_realloc(dp, -dp->i_df.if_bytes, XFS_DATA_FORK); dp->i_d.di_size = 0; xfs_trans_log_inode(tp, dp, XFS_ILOG_CORE); /* * Reset pointer - old sfp is gone. */ sfp = (xfs_dir2_sf_t *)buf; /* * Add block 0 to the inode. */ error = xfs_dir2_grow_inode(args, XFS_DIR2_DATA_SPACE, &blkno); if (error) { |
f0e2d93c2 [XFS] Remove unus... |
1085 |
kmem_free(buf); |
1da177e4c Linux-2.6.12-rc2 |
1086 1087 1088 1089 1090 1091 1092 |
return error; } /* * Initialize the data block. */ error = xfs_dir2_data_init(args, blkno, &bp); if (error) { |
f0e2d93c2 [XFS] Remove unus... |
1093 |
kmem_free(buf); |
1da177e4c Linux-2.6.12-rc2 |
1094 1095 1096 |
return error; } block = bp->data; |
70e73f597 [XFS] endianess a... |
1097 |
block->hdr.magic = cpu_to_be32(XFS_DIR2_BLOCK_MAGIC); |
1da177e4c Linux-2.6.12-rc2 |
1098 1099 1100 1101 |
/* * Compute size of block "tail" area. */ i = (uint)sizeof(*btp) + |
8f44e047a [XFS] remove bogu... |
1102 |
(sfp->hdr.count + 2) * (uint)sizeof(xfs_dir2_leaf_entry_t); |
1da177e4c Linux-2.6.12-rc2 |
1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 |
/* * The whole thing is initialized to free by the init routine. * Say we're using the leaf and tail area. */ dup = (xfs_dir2_data_unused_t *)block->u; needlog = needscan = 0; xfs_dir2_data_use_free(tp, bp, dup, mp->m_dirblksize - i, i, &needlog, &needscan); ASSERT(needscan == 0); /* * Fill in the tail. */ |
bbaaf5380 [XFS] Reduce shou... |
1115 |
btp = xfs_dir2_block_tail_p(mp, block); |
8f44e047a [XFS] remove bogu... |
1116 |
btp->count = cpu_to_be32(sfp->hdr.count + 2); /* ., .. */ |
1da177e4c Linux-2.6.12-rc2 |
1117 |
btp->stale = 0; |
bbaaf5380 [XFS] Reduce shou... |
1118 |
blp = xfs_dir2_block_leaf_p(btp); |
1da177e4c Linux-2.6.12-rc2 |
1119 1120 1121 1122 1123 1124 |
endoffset = (uint)((char *)blp - (char *)block); /* * Remove the freespace, we'll manage it. */ xfs_dir2_data_use_free(tp, bp, dup, (xfs_dir2_data_aoff_t)((char *)dup - (char *)block), |
ad354eb34 [XFS] endianess a... |
1125 |
be16_to_cpu(dup->length), &needlog, &needscan); |
1da177e4c Linux-2.6.12-rc2 |
1126 1127 1128 1129 1130 |
/* * Create entry for . */ dep = (xfs_dir2_data_entry_t *) ((char *)block + XFS_DIR2_DATA_DOT_OFFSET); |
ff9901c1e [XFS] endianess a... |
1131 |
dep->inumber = cpu_to_be64(dp->i_ino); |
1da177e4c Linux-2.6.12-rc2 |
1132 1133 |
dep->namelen = 1; dep->name[0] = '.'; |
bbaaf5380 [XFS] Reduce shou... |
1134 |
tagp = xfs_dir2_data_entry_tag_p(dep); |
3d693c6ed [XFS] endianess a... |
1135 |
*tagp = cpu_to_be16((char *)dep - (char *)block); |
1da177e4c Linux-2.6.12-rc2 |
1136 |
xfs_dir2_data_log_entry(tp, bp, dep); |
3c1f9c158 [XFS] endianess a... |
1137 |
blp[0].hashval = cpu_to_be32(xfs_dir_hash_dot); |
bbaaf5380 [XFS] Reduce shou... |
1138 |
blp[0].address = cpu_to_be32(xfs_dir2_byte_to_dataptr(mp, |
3c1f9c158 [XFS] endianess a... |
1139 |
(char *)dep - (char *)block)); |
1da177e4c Linux-2.6.12-rc2 |
1140 1141 1142 1143 1144 |
/* * Create entry for .. */ dep = (xfs_dir2_data_entry_t *) ((char *)block + XFS_DIR2_DATA_DOTDOT_OFFSET); |
bbaaf5380 [XFS] Reduce shou... |
1145 |
dep->inumber = cpu_to_be64(xfs_dir2_sf_get_inumber(sfp, &sfp->hdr.parent)); |
1da177e4c Linux-2.6.12-rc2 |
1146 1147 |
dep->namelen = 2; dep->name[0] = dep->name[1] = '.'; |
bbaaf5380 [XFS] Reduce shou... |
1148 |
tagp = xfs_dir2_data_entry_tag_p(dep); |
3d693c6ed [XFS] endianess a... |
1149 |
*tagp = cpu_to_be16((char *)dep - (char *)block); |
1da177e4c Linux-2.6.12-rc2 |
1150 |
xfs_dir2_data_log_entry(tp, bp, dep); |
3c1f9c158 [XFS] endianess a... |
1151 |
blp[1].hashval = cpu_to_be32(xfs_dir_hash_dotdot); |
bbaaf5380 [XFS] Reduce shou... |
1152 |
blp[1].address = cpu_to_be32(xfs_dir2_byte_to_dataptr(mp, |
3c1f9c158 [XFS] endianess a... |
1153 |
(char *)dep - (char *)block)); |
1da177e4c Linux-2.6.12-rc2 |
1154 1155 1156 1157 |
offset = XFS_DIR2_DATA_FIRST_OFFSET; /* * Loop over existing entries, stuff them in. */ |
8f44e047a [XFS] remove bogu... |
1158 |
if ((i = 0) == sfp->hdr.count) |
1da177e4c Linux-2.6.12-rc2 |
1159 1160 |
sfep = NULL; else |
bbaaf5380 [XFS] Reduce shou... |
1161 |
sfep = xfs_dir2_sf_firstentry(sfp); |
1da177e4c Linux-2.6.12-rc2 |
1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 |
/* * Need to preserve the existing offset values in the sf directory. * Insert holes (unused entries) where necessary. */ while (offset < endoffset) { /* * sfep is null when we reach the end of the list. */ if (sfep == NULL) newoffset = endoffset; else |
bbaaf5380 [XFS] Reduce shou... |
1173 |
newoffset = xfs_dir2_sf_get_offset(sfep); |
1da177e4c Linux-2.6.12-rc2 |
1174 1175 1176 1177 1178 1179 |
/* * There should be a hole here, make one. */ if (offset < newoffset) { dup = (xfs_dir2_data_unused_t *) ((char *)block + offset); |
ad354eb34 [XFS] endianess a... |
1180 1181 |
dup->freetag = cpu_to_be16(XFS_DIR2_DATA_FREE_TAG); dup->length = cpu_to_be16(newoffset - offset); |
bbaaf5380 [XFS] Reduce shou... |
1182 |
*xfs_dir2_data_unused_tag_p(dup) = cpu_to_be16( |
1da177e4c Linux-2.6.12-rc2 |
1183 1184 1185 1186 |
((char *)dup - (char *)block)); xfs_dir2_data_log_unused(tp, bp, dup); (void)xfs_dir2_data_freeinsert((xfs_dir2_data_t *)block, dup, &dummy); |
ad354eb34 [XFS] endianess a... |
1187 |
offset += be16_to_cpu(dup->length); |
1da177e4c Linux-2.6.12-rc2 |
1188 1189 1190 1191 1192 1193 |
continue; } /* * Copy a real entry. */ dep = (xfs_dir2_data_entry_t *)((char *)block + newoffset); |
bbaaf5380 [XFS] Reduce shou... |
1194 1195 |
dep->inumber = cpu_to_be64(xfs_dir2_sf_get_inumber(sfp, xfs_dir2_sf_inumberp(sfep))); |
1da177e4c Linux-2.6.12-rc2 |
1196 1197 |
dep->namelen = sfep->namelen; memcpy(dep->name, sfep->name, dep->namelen); |
bbaaf5380 [XFS] Reduce shou... |
1198 |
tagp = xfs_dir2_data_entry_tag_p(dep); |
3d693c6ed [XFS] endianess a... |
1199 |
*tagp = cpu_to_be16((char *)dep - (char *)block); |
1da177e4c Linux-2.6.12-rc2 |
1200 |
xfs_dir2_data_log_entry(tp, bp, dep); |
5163f95a0 [XFS] Name operat... |
1201 1202 1203 1204 |
name.name = sfep->name; name.len = sfep->namelen; blp[2 + i].hashval = cpu_to_be32(mp->m_dirnameops-> hashname(&name)); |
bbaaf5380 [XFS] Reduce shou... |
1205 |
blp[2 + i].address = cpu_to_be32(xfs_dir2_byte_to_dataptr(mp, |
1da177e4c Linux-2.6.12-rc2 |
1206 1207 |
(char *)dep - (char *)block)); offset = (int)((char *)(tagp + 1) - (char *)block); |
8f44e047a [XFS] remove bogu... |
1208 |
if (++i == sfp->hdr.count) |
1da177e4c Linux-2.6.12-rc2 |
1209 1210 |
sfep = NULL; else |
bbaaf5380 [XFS] Reduce shou... |
1211 |
sfep = xfs_dir2_sf_nextentry(sfp, sfep); |
1da177e4c Linux-2.6.12-rc2 |
1212 1213 |
} /* Done with the temporary buffer */ |
f0e2d93c2 [XFS] Remove unus... |
1214 |
kmem_free(buf); |
1da177e4c Linux-2.6.12-rc2 |
1215 1216 1217 |
/* * Sort the leaf entries by hash value. */ |
e922fffa4 [XFS] endianess a... |
1218 |
xfs_sort(blp, be32_to_cpu(btp->count), sizeof(*blp), xfs_dir2_block_sort); |
1da177e4c Linux-2.6.12-rc2 |
1219 1220 1221 1222 1223 |
/* * Log the leaf entry area and tail. * Already logged the header in data_init, ignore needlog. */ ASSERT(needscan == 0); |
e922fffa4 [XFS] endianess a... |
1224 |
xfs_dir2_block_log_leaf(tp, bp, 0, be32_to_cpu(btp->count) - 1); |
1da177e4c Linux-2.6.12-rc2 |
1225 1226 1227 1228 1229 |
xfs_dir2_block_log_tail(tp, bp); xfs_dir2_data_check(dp, bp); xfs_da_buf_done(bp); return 0; } |