?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
ktest: Use Kconfig dependencies to shorten time to make min_config
[linux-2.6.git] / fs / xfs / xfs_dir2.c
blobdba7a71cedf3e6f903368416554730d9885142ad
1 /*
2 * Copyright (c) 2000-2001,2005 Silicon Graphics, Inc.
3 * All Rights Reserved.
4 *
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License as
7 * published by the Free Software Foundation.
8 *
9 * This program is distributed in the hope that it would be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
13 *
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write the Free Software Foundation,
16 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
17 */
18 #include "xfs.h"
19 #include "xfs_fs.h"
20 #include "xfs_types.h"
21 #include "xfs_bit.h"
22 #include "xfs_log.h"
23 #include "xfs_inum.h"
24 #include "xfs_trans.h"
25 #include "xfs_sb.h"
26 #include "xfs_ag.h"
27 #include "xfs_dir2.h"
28 #include "xfs_mount.h"
29 #include "xfs_da_btree.h"
30 #include "xfs_bmap_btree.h"
31 #include "xfs_alloc_btree.h"
32 #include "xfs_dir2_sf.h"
33 #include "xfs_dinode.h"
34 #include "xfs_inode.h"
35 #include "xfs_inode_item.h"
36 #include "xfs_bmap.h"
37 #include "xfs_dir2_data.h"
38 #include "xfs_dir2_leaf.h"
39 #include "xfs_dir2_block.h"
40 #include "xfs_dir2_node.h"
41 #include "xfs_error.h"
42 #include "xfs_vnodeops.h"
43 #include "xfs_trace.h"
44
45 struct xfs_name xfs_name_dotdot = { (unsigned char *)"..", 2};
46
47 /*
48 * ASCII case-insensitive (ie. A-Z) support for directories that was
49 * used in IRIX.
50 */
51 STATIC xfs_dahash_t
52 xfs_ascii_ci_hashname(
53 struct xfs_name *name)
54 {
55 xfs_dahash_t hash;
56 int i;
57
58 for (i = 0, hash = 0; i < name->len; i++)
59 hash = tolower(name->name[i]) ^ rol32(hash, 7);
60
61 return hash;
62 }
63
64 STATIC enum xfs_dacmp
65 xfs_ascii_ci_compname(
66 struct xfs_da_args *args,
67 const unsigned char *name,
68 int len)
69 {
70 enum xfs_dacmp result;
71 int i;
72
73 if (args->namelen != len)
74 return XFS_CMP_DIFFERENT;
75
76 result = XFS_CMP_EXACT;
77 for (i = 0; i < len; i++) {
78 if (args->name[i] == name[i])
79 continue;
80 if (tolower(args->name[i]) != tolower(name[i]))
81 return XFS_CMP_DIFFERENT;
82 result = XFS_CMP_CASE;
83 }
84
85 return result;
86 }
87
88 static struct xfs_nameops xfs_ascii_ci_nameops = {
89 .hashname = xfs_ascii_ci_hashname,
90 .compname = xfs_ascii_ci_compname,
91 };
92
93 void
94 xfs_dir_mount(
95 xfs_mount_t *mp)
96 {
97 ASSERT(xfs_sb_version_hasdirv2(&mp->m_sb));
98 ASSERT((1 << (mp->m_sb.sb_blocklog + mp->m_sb.sb_dirblklog)) <=
99 XFS_MAX_BLOCKSIZE);
100 mp->m_dirblksize = 1 << (mp->m_sb.sb_blocklog + mp->m_sb.sb_dirblklog);
101 mp->m_dirblkfsbs = 1 << mp->m_sb.sb_dirblklog;
102 mp->m_dirdatablk = xfs_dir2_db_to_da(mp, XFS_DIR2_DATA_FIRSTDB(mp));
103 mp->m_dirleafblk = xfs_dir2_db_to_da(mp, XFS_DIR2_LEAF_FIRSTDB(mp));
104 mp->m_dirfreeblk = xfs_dir2_db_to_da(mp, XFS_DIR2_FREE_FIRSTDB(mp));
105 mp->m_attr_node_ents =
106 (mp->m_sb.sb_blocksize - (uint)sizeof(xfs_da_node_hdr_t)) /
107 (uint)sizeof(xfs_da_node_entry_t);
108 mp->m_dir_node_ents =
109 (mp->m_dirblksize - (uint)sizeof(xfs_da_node_hdr_t)) /
110 (uint)sizeof(xfs_da_node_entry_t);
111 mp->m_dir_magicpct = (mp->m_dirblksize * 37) / 100;
112 if (xfs_sb_version_hasasciici(&mp->m_sb))
113 mp->m_dirnameops = &xfs_ascii_ci_nameops;
114 else
115 mp->m_dirnameops = &xfs_default_nameops;
116 }
117
118 /*
119 * Return 1 if directory contains only "." and "..".
120 */
121 int
122 xfs_dir_isempty(
123 xfs_inode_t *dp)
124 {
125 xfs_dir2_sf_t *sfp;
126
127 ASSERT((dp->i_d.di_mode & S_IFMT) == S_IFDIR);
128 if (dp->i_d.di_size == 0) /* might happen during shutdown. */
129 return 1;
130 if (dp->i_d.di_size > XFS_IFORK_DSIZE(dp))
131 return 0;
132 sfp = (xfs_dir2_sf_t *)dp->i_df.if_u1.if_data;
133 return !sfp->hdr.count;
134 }
135
136 /*
137 * Validate a given inode number.
138 */
139 int
140 xfs_dir_ino_validate(
141 xfs_mount_t *mp,
142 xfs_ino_t ino)
143 {
144 xfs_agblock_t agblkno;
145 xfs_agino_t agino;
146 xfs_agnumber_t agno;
147 int ino_ok;
148 int ioff;
149
150 agno = XFS_INO_TO_AGNO(mp, ino);
151 agblkno = XFS_INO_TO_AGBNO(mp, ino);
152 ioff = XFS_INO_TO_OFFSET(mp, ino);
153 agino = XFS_OFFBNO_TO_AGINO(mp, agblkno, ioff);
154 ino_ok =
155 agno < mp->m_sb.sb_agcount &&
156 agblkno < mp->m_sb.sb_agblocks &&
157 agblkno != 0 &&
158 ioff < (1 << mp->m_sb.sb_inopblog) &&
159 XFS_AGINO_TO_INO(mp, agno, agino) == ino;
160 if (unlikely(XFS_TEST_ERROR(!ino_ok, mp, XFS_ERRTAG_DIR_INO_VALIDATE,
161 XFS_RANDOM_DIR_INO_VALIDATE))) {
162 xfs_warn(mp, "Invalid inode number 0x%Lx",
163 (unsigned long long) ino);
164 XFS_ERROR_REPORT("xfs_dir_ino_validate", XFS_ERRLEVEL_LOW, mp);
165 return XFS_ERROR(EFSCORRUPTED);
166 }
167 return 0;
168 }
169
170 /*
171 * Initialize a directory with its "." and ".." entries.
172 */
173 int
174 xfs_dir_init(
175 xfs_trans_t *tp,
176 xfs_inode_t *dp,
177 xfs_inode_t *pdp)
178 {
179 xfs_da_args_t args;
180 int error;
181
182 memset((char *)&args, 0, sizeof(args));
183 args.dp = dp;
184 args.trans = tp;
185 ASSERT((dp->i_d.di_mode & S_IFMT) == S_IFDIR);
186 if ((error = xfs_dir_ino_validate(tp->t_mountp, pdp->i_ino)))
187 return error;
188 return xfs_dir2_sf_create(&args, pdp->i_ino);
189 }
190
191 /*
192 Enter a name in a directory.
193 */
194 int
195 xfs_dir_createname(
196 xfs_trans_t *tp,
197 xfs_inode_t *dp,
198 struct xfs_name *name,
199 xfs_ino_t inum, /* new entry inode number */
200 xfs_fsblock_t *first, /* bmap's firstblock */
201 xfs_bmap_free_t *flist, /* bmap's freeblock list */
202 xfs_extlen_t total) /* bmap's total block count */
203 {
204 xfs_da_args_t args;
205 int rval;
206 int v; /* type-checking value */
207
208 ASSERT((dp->i_d.di_mode & S_IFMT) == S_IFDIR);
209 if ((rval = xfs_dir_ino_validate(tp->t_mountp, inum)))
210 return rval;
211 XFS_STATS_INC(xs_dir_create);
212
213 memset(&args, 0, sizeof(xfs_da_args_t));
214 args.name = name->name;
215 args.namelen = name->len;
216 args.hashval = dp->i_mount->m_dirnameops->hashname(name);
217 args.inumber = inum;
218 args.dp = dp;
219 args.firstblock = first;
220 args.flist = flist;
221 args.total = total;
222 args.whichfork = XFS_DATA_FORK;
223 args.trans = tp;
224 args.op_flags = XFS_DA_OP_ADDNAME | XFS_DA_OP_OKNOENT;
225
226 if (dp->i_d.di_format == XFS_DINODE_FMT_LOCAL)
227 rval = xfs_dir2_sf_addname(&args);
228 else if ((rval = xfs_dir2_isblock(tp, dp, &v)))
229 return rval;
230 else if (v)
231 rval = xfs_dir2_block_addname(&args);
232 else if ((rval = xfs_dir2_isleaf(tp, dp, &v)))
233 return rval;
234 else if (v)
235 rval = xfs_dir2_leaf_addname(&args);
236 else
237 rval = xfs_dir2_node_addname(&args);
238 return rval;
239 }
240
241 /*
242 * If doing a CI lookup and case-insensitive match, dup actual name into
243 * args.value. Return EEXIST for success (ie. name found) or an error.
244 */
245 int
246 xfs_dir_cilookup_result(
247 struct xfs_da_args *args,
248 const unsigned char *name,
249 int len)
250 {
251 if (args->cmpresult == XFS_CMP_DIFFERENT)
252 return ENOENT;
253 if (args->cmpresult != XFS_CMP_CASE ||
254 !(args->op_flags & XFS_DA_OP_CILOOKUP))
255 return EEXIST;
256
257 args->value = kmem_alloc(len, KM_NOFS | KM_MAYFAIL);
258 if (!args->value)
259 return ENOMEM;
260
261 memcpy(args->value, name, len);
262 args->valuelen = len;
263 return EEXIST;
264 }
265
266 /*
267 * Lookup a name in a directory, give back the inode number.
268 * If ci_name is not NULL, returns the actual name in ci_name if it differs
269 * to name, or ci_name->name is set to NULL for an exact match.
270 */
271
272 int
273 xfs_dir_lookup(
274 xfs_trans_t *tp,
275 xfs_inode_t *dp,
276 struct xfs_name *name,
277 xfs_ino_t *inum, /* out: inode number */
278 struct xfs_name *ci_name) /* out: actual name if CI match */
279 {
280 xfs_da_args_t args;
281 int rval;
282 int v; /* type-checking value */
283
284 ASSERT((dp->i_d.di_mode & S_IFMT) == S_IFDIR);
285 XFS_STATS_INC(xs_dir_lookup);
286
287 memset(&args, 0, sizeof(xfs_da_args_t));
288 args.name = name->name;
289 args.namelen = name->len;
290 args.hashval = dp->i_mount->m_dirnameops->hashname(name);
291 args.dp = dp;
292 args.whichfork = XFS_DATA_FORK;
293 args.trans = tp;
294 args.op_flags = XFS_DA_OP_OKNOENT;
295 if (ci_name)
296 args.op_flags |= XFS_DA_OP_CILOOKUP;
297
298 if (dp->i_d.di_format == XFS_DINODE_FMT_LOCAL)
299 rval = xfs_dir2_sf_lookup(&args);
300 else if ((rval = xfs_dir2_isblock(tp, dp, &v)))
301 return rval;
302 else if (v)
303 rval = xfs_dir2_block_lookup(&args);
304 else if ((rval = xfs_dir2_isleaf(tp, dp, &v)))
305 return rval;
306 else if (v)
307 rval = xfs_dir2_leaf_lookup(&args);
308 else
309 rval = xfs_dir2_node_lookup(&args);
310 if (rval == EEXIST)
311 rval = 0;
312 if (!rval) {
313 *inum = args.inumber;
314 if (ci_name) {
315 ci_name->name = args.value;
316 ci_name->len = args.valuelen;
317 }
318 }
319 return rval;
320 }
321
322 /*
323 * Remove an entry from a directory.
324 */
325 int
326 xfs_dir_removename(
327 xfs_trans_t *tp,
328 xfs_inode_t *dp,
329 struct xfs_name *name,
330 xfs_ino_t ino,
331 xfs_fsblock_t *first, /* bmap's firstblock */
332 xfs_bmap_free_t *flist, /* bmap's freeblock list */
333 xfs_extlen_t total) /* bmap's total block count */
334 {
335 xfs_da_args_t args;
336 int rval;
337 int v; /* type-checking value */
338
339 ASSERT((dp->i_d.di_mode & S_IFMT) == S_IFDIR);
340 XFS_STATS_INC(xs_dir_remove);
341
342 memset(&args, 0, sizeof(xfs_da_args_t));
343 args.name = name->name;
344 args.namelen = name->len;
345 args.hashval = dp->i_mount->m_dirnameops->hashname(name);
346 args.inumber = ino;
347 args.dp = dp;
348 args.firstblock = first;
349 args.flist = flist;
350 args.total = total;
351 args.whichfork = XFS_DATA_FORK;
352 args.trans = tp;
353
354 if (dp->i_d.di_format == XFS_DINODE_FMT_LOCAL)
355 rval = xfs_dir2_sf_removename(&args);
356 else if ((rval = xfs_dir2_isblock(tp, dp, &v)))
357 return rval;
358 else if (v)
359 rval = xfs_dir2_block_removename(&args);
360 else if ((rval = xfs_dir2_isleaf(tp, dp, &v)))
361 return rval;
362 else if (v)
363 rval = xfs_dir2_leaf_removename(&args);
364 else
365 rval = xfs_dir2_node_removename(&args);
366 return rval;
367 }
368
369 /*
370 * Read a directory.
371 */
372 int
373 xfs_readdir(
374 xfs_inode_t *dp,
375 void *dirent,
376 size_t bufsize,
377 xfs_off_t *offset,
378 filldir_t filldir)
379 {
380 int rval; /* return value */
381 int v; /* type-checking value */
382
383 trace_xfs_readdir(dp);
384
385 if (XFS_FORCED_SHUTDOWN(dp->i_mount))
386 return XFS_ERROR(EIO);
387
388 ASSERT((dp->i_d.di_mode & S_IFMT) == S_IFDIR);
389 XFS_STATS_INC(xs_dir_getdents);
390
391 if (dp->i_d.di_format == XFS_DINODE_FMT_LOCAL)
392 rval = xfs_dir2_sf_getdents(dp, dirent, offset, filldir);
393 else if ((rval = xfs_dir2_isblock(NULL, dp, &v)))
394 ;
395 else if (v)
396 rval = xfs_dir2_block_getdents(dp, dirent, offset, filldir);
397 else
398 rval = xfs_dir2_leaf_getdents(dp, dirent, bufsize, offset,
399 filldir);
400 return rval;
401 }
402
403 /*
404 * Replace the inode number of a directory entry.
405 */
406 int
407 xfs_dir_replace(
408 xfs_trans_t *tp,
409 xfs_inode_t *dp,
410 struct xfs_name *name, /* name of entry to replace */
411 xfs_ino_t inum, /* new inode number */
412 xfs_fsblock_t *first, /* bmap's firstblock */
413 xfs_bmap_free_t *flist, /* bmap's freeblock list */
414 xfs_extlen_t total) /* bmap's total block count */
415 {
416 xfs_da_args_t args;
417 int rval;
418 int v; /* type-checking value */
419
420 ASSERT((dp->i_d.di_mode & S_IFMT) == S_IFDIR);
421
422 if ((rval = xfs_dir_ino_validate(tp->t_mountp, inum)))
423 return rval;
424
425 memset(&args, 0, sizeof(xfs_da_args_t));
426 args.name = name->name;
427 args.namelen = name->len;
428 args.hashval = dp->i_mount->m_dirnameops->hashname(name);
429 args.inumber = inum;
430 args.dp = dp;
431 args.firstblock = first;
432 args.flist = flist;
433 args.total = total;
434 args.whichfork = XFS_DATA_FORK;
435 args.trans = tp;
436
437 if (dp->i_d.di_format == XFS_DINODE_FMT_LOCAL)
438 rval = xfs_dir2_sf_replace(&args);
439 else if ((rval = xfs_dir2_isblock(tp, dp, &v)))
440 return rval;
441 else if (v)
442 rval = xfs_dir2_block_replace(&args);
443 else if ((rval = xfs_dir2_isleaf(tp, dp, &v)))
444 return rval;
445 else if (v)
446 rval = xfs_dir2_leaf_replace(&args);
447 else
448 rval = xfs_dir2_node_replace(&args);
449 return rval;
450 }
451
452 /*
453 * See if this entry can be added to the directory without allocating space.
454 * First checks that the caller couldn't reserve enough space (resblks = 0).
455 */
456 int
457 xfs_dir_canenter(
458 xfs_trans_t *tp,
459 xfs_inode_t *dp,
460 struct xfs_name *name, /* name of entry to add */
461 uint resblks)
462 {
463 xfs_da_args_t args;
464 int rval;
465 int v; /* type-checking value */
466
467 if (resblks)
468 return 0;
469
470 ASSERT((dp->i_d.di_mode & S_IFMT) == S_IFDIR);
471
472 memset(&args, 0, sizeof(xfs_da_args_t));
473 args.name = name->name;
474 args.namelen = name->len;
475 args.hashval = dp->i_mount->m_dirnameops->hashname(name);
476 args.dp = dp;
477 args.whichfork = XFS_DATA_FORK;
478 args.trans = tp;
479 args.op_flags = XFS_DA_OP_JUSTCHECK | XFS_DA_OP_ADDNAME |
480 XFS_DA_OP_OKNOENT;
481
482 if (dp->i_d.di_format == XFS_DINODE_FMT_LOCAL)
483 rval = xfs_dir2_sf_addname(&args);
484 else if ((rval = xfs_dir2_isblock(tp, dp, &v)))
485 return rval;
486 else if (v)
487 rval = xfs_dir2_block_addname(&args);
488 else if ((rval = xfs_dir2_isleaf(tp, dp, &v)))
489 return rval;
490 else if (v)
491 rval = xfs_dir2_leaf_addname(&args);
492 else
493 rval = xfs_dir2_node_addname(&args);
494 return rval;
495 }
496
497 /*
498 * Utility routines.
499 */
500
501 /*
502 * Add a block to the directory.
503 * This routine is for data and free blocks, not leaf/node blocks
504 * which are handled by xfs_da_grow_inode.
505 */
506 int
507 xfs_dir2_grow_inode(
508 xfs_da_args_t *args,
509 int space, /* v2 dir's space XFS_DIR2_xxx_SPACE */
510 xfs_dir2_db_t *dbp) /* out: block number added */
511 {
512 xfs_fileoff_t bno; /* directory offset of new block */
513 int count; /* count of filesystem blocks */
514 xfs_inode_t *dp; /* incore directory inode */
515 int error;
516 int got; /* blocks actually mapped */
517 int i;
518 xfs_bmbt_irec_t map; /* single structure for bmap */
519 int mapi; /* mapping index */
520 xfs_bmbt_irec_t *mapp; /* bmap mapping structure(s) */
521 xfs_mount_t *mp;
522 int nmap; /* number of bmap entries */
523 xfs_trans_t *tp;
524 xfs_drfsbno_t nblks;
525
526 trace_xfs_dir2_grow_inode(args, space);
527
528 dp = args->dp;
529 tp = args->trans;
530 mp = dp->i_mount;
531 nblks = dp->i_d.di_nblocks;
532 /*
533 * Set lowest possible block in the space requested.
534 */
535 bno = XFS_B_TO_FSBT(mp, space * XFS_DIR2_SPACE_SIZE);
536 count = mp->m_dirblkfsbs;
537 /*
538 * Find the first hole for our block.
539 */
540 if ((error = xfs_bmap_first_unused(tp, dp, count, &bno, XFS_DATA_FORK)))
541 return error;
542 nmap = 1;
543 ASSERT(args->firstblock != NULL);
544 /*
545 * Try mapping the new block contiguously (one extent).
546 */
547 if ((error = xfs_bmapi(tp, dp, bno, count,
548 XFS_BMAPI_WRITE|XFS_BMAPI_METADATA|XFS_BMAPI_CONTIG,
549 args->firstblock, args->total, &map, &nmap,
550 args->flist)))
551 return error;
552 ASSERT(nmap <= 1);
553 if (nmap == 1) {
554 mapp = &map;
555 mapi = 1;
556 }
557 /*
558 * Didn't work and this is a multiple-fsb directory block.
559 * Try again with contiguous flag turned on.
560 */
561 else if (nmap == 0 && count > 1) {
562 xfs_fileoff_t b; /* current file offset */
563
564 /*
565 * Space for maximum number of mappings.
566 */
567 mapp = kmem_alloc(sizeof(*mapp) * count, KM_SLEEP);
568 /*
569 * Iterate until we get to the end of our block.
570 */
571 for (b = bno, mapi = 0; b < bno + count; ) {
572 int c; /* current fsb count */
573
574 /*
575 * Can't map more than MAX_NMAP at once.
576 */
577 nmap = MIN(XFS_BMAP_MAX_NMAP, count);
578 c = (int)(bno + count - b);
579 if ((error = xfs_bmapi(tp, dp, b, c,
580 XFS_BMAPI_WRITE|XFS_BMAPI_METADATA,
581 args->firstblock, args->total,
582 &mapp[mapi], &nmap, args->flist))) {
583 kmem_free(mapp);
584 return error;
585 }
586 if (nmap < 1)
587 break;
588 /*
589 * Add this bunch into our table, go to the next offset.
590 */
591 mapi += nmap;
592 b = mapp[mapi - 1].br_startoff +
593 mapp[mapi - 1].br_blockcount;
594 }
595 }
596 /*
597 * Didn't work.
598 */
599 else {
600 mapi = 0;
601 mapp = NULL;
602 }
603 /*
604 * See how many fsb's we got.
605 */
606 for (i = 0, got = 0; i < mapi; i++)
607 got += mapp[i].br_blockcount;
608 /*
609 * Didn't get enough fsb's, or the first/last block's are wrong.
610 */
611 if (got != count || mapp[0].br_startoff != bno ||
612 mapp[mapi - 1].br_startoff + mapp[mapi - 1].br_blockcount !=
613 bno + count) {
614 if (mapp != &map)
615 kmem_free(mapp);
616 return XFS_ERROR(ENOSPC);
617 }
618 /*
619 * Done with the temporary mapping table.
620 */
621 if (mapp != &map)
622 kmem_free(mapp);
623
624 /* account for newly allocated blocks in reserved blocks total */
625 args->total -= dp->i_d.di_nblocks - nblks;
626 *dbp = xfs_dir2_da_to_db(mp, (xfs_dablk_t)bno);
627
628 /*
629 * Update file's size if this is the data space and it grew.
630 */
631 if (space == XFS_DIR2_DATA_SPACE) {
632 xfs_fsize_t size; /* directory file (data) size */
633
634 size = XFS_FSB_TO_B(mp, bno + count);
635 if (size > dp->i_d.di_size) {
636 dp->i_d.di_size = size;
637 xfs_trans_log_inode(tp, dp, XFS_ILOG_CORE);
638 }
639 }
640 return 0;
641 }
642
643 /*
644 * See if the directory is a single-block form directory.
645 */
646 int
647 xfs_dir2_isblock(
648 xfs_trans_t *tp,
649 xfs_inode_t *dp,
650 int *vp) /* out: 1 is block, 0 is not block */
651 {
652 xfs_fileoff_t last; /* last file offset */
653 xfs_mount_t *mp;
654 int rval;
655
656 mp = dp->i_mount;
657 if ((rval = xfs_bmap_last_offset(tp, dp, &last, XFS_DATA_FORK)))
658 return rval;
659 rval = XFS_FSB_TO_B(mp, last) == mp->m_dirblksize;
660 ASSERT(rval == 0 || dp->i_d.di_size == mp->m_dirblksize);
661 *vp = rval;
662 return 0;
663 }
664
665 /*
666 * See if the directory is a single-leaf form directory.
667 */
668 int
669 xfs_dir2_isleaf(
670 xfs_trans_t *tp,
671 xfs_inode_t *dp,
672 int *vp) /* out: 1 is leaf, 0 is not leaf */
673 {
674 xfs_fileoff_t last; /* last file offset */
675 xfs_mount_t *mp;
676 int rval;
677
678 mp = dp->i_mount;
679 if ((rval = xfs_bmap_last_offset(tp, dp, &last, XFS_DATA_FORK)))
680 return rval;
681 *vp = last == mp->m_dirleafblk + (1 << mp->m_sb.sb_dirblklog);
682 return 0;
683 }
684
685 /*
686 * Remove the given block from the directory.
687 * This routine is used for data and free blocks, leaf/node are done
688 * by xfs_da_shrink_inode.
689 */
690 int
691 xfs_dir2_shrink_inode(
692 xfs_da_args_t *args,
693 xfs_dir2_db_t db,
694 xfs_dabuf_t *bp)
695 {
696 xfs_fileoff_t bno; /* directory file offset */
697 xfs_dablk_t da; /* directory file offset */
698 int done; /* bunmap is finished */
699 xfs_inode_t *dp;
700 int error;
701 xfs_mount_t *mp;
702 xfs_trans_t *tp;
703
704 trace_xfs_dir2_shrink_inode(args, db);
705
706 dp = args->dp;
707 mp = dp->i_mount;
708 tp = args->trans;
709 da = xfs_dir2_db_to_da(mp, db);
710 /*
711 * Unmap the fsblock(s).
712 */
713 if ((error = xfs_bunmapi(tp, dp, da, mp->m_dirblkfsbs,
714 XFS_BMAPI_METADATA, 0, args->firstblock, args->flist,
715 &done))) {
716 /*
717 * ENOSPC actually can happen if we're in a removename with
718 * no space reservation, and the resulting block removal
719 * would cause a bmap btree split or conversion from extents
720 * to btree. This can only happen for un-fragmented
721 * directory blocks, since you need to be punching out
722 * the middle of an extent.
723 * In this case we need to leave the block in the file,
724 * and not binval it.
725 * So the block has to be in a consistent empty state
726 * and appropriately logged.
727 * We don't free up the buffer, the caller can tell it
728 * hasn't happened since it got an error back.
729 */
730 return error;
731 }
732 ASSERT(done);
733 /*
734 * Invalidate the buffer from the transaction.
735 */
736 xfs_da_binval(tp, bp);
737 /*
738 * If it's not a data block, we're done.
739 */
740 if (db >= XFS_DIR2_LEAF_FIRSTDB(mp))
741 return 0;
742 /*
743 * If the block isn't the last one in the directory, we're done.
744 */
745 if (dp->i_d.di_size > xfs_dir2_db_off_to_byte(mp, db + 1, 0))
746 return 0;
747 bno = da;
748 if ((error = xfs_bmap_last_before(tp, dp, &bno, XFS_DATA_FORK))) {
749 /*
750 * This can't really happen unless there's kernel corruption.
751 */
752 return error;
753 }
754 if (db == mp->m_dirdatablk)
755 ASSERT(bno == 0);
756 else
757 ASSERT(bno > 0);
758 /*
759 * Set the size to the new last block.
760 */
761 dp->i_d.di_size = XFS_FSB_TO_B(mp, bno);
762 xfs_trans_log_inode(tp, dp, XFS_ILOG_CORE);
763 return 0;
764 }
Linus' kernel tree