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_format.h"
21 #include "xfs_log_format.h"
22 #include "xfs_trans_resv.h"
23 #include "xfs_inum.h"
24 #include "xfs_sb.h"
25 #include "xfs_ag.h"
26 #include "xfs_mount.h"
27 #include "xfs_da_format.h"
28 #include "xfs_da_btree.h"
29 #include "xfs_inode.h"
30 #include "xfs_trans.h"
31 #include "xfs_inode_item.h"
32 #include "xfs_bmap.h"
33 #include "xfs_dir2.h"
34 #include "xfs_dir2_priv.h"
35 #include "xfs_error.h"
36 #include "xfs_trace.h"
37 #include "xfs_dinode.h"
38
39 struct xfs_name xfs_name_dotdot = { (unsigned char *)"..", 2, XFS_DIR3_FT_DIR };
40
41
42 /*
43 * ASCII case-insensitive (ie. A-Z) support for directories that was
44 * used in IRIX.
45 */
46 STATIC xfs_dahash_t
xfs_ascii_ci_hashname(struct xfs_name * name)47 xfs_ascii_ci_hashname(
48 struct xfs_name *name)
49 {
50 xfs_dahash_t hash;
51 int i;
52
53 for (i = 0, hash = 0; i < name->len; i++)
54 hash = tolower(name->name[i]) ^ rol32(hash, 7);
55
56 return hash;
57 }
58
59 STATIC enum xfs_dacmp
xfs_ascii_ci_compname(struct xfs_da_args * args,const unsigned char * name,int len)60 xfs_ascii_ci_compname(
61 struct xfs_da_args *args,
62 const unsigned char *name,
63 int len)
64 {
65 enum xfs_dacmp result;
66 int i;
67
68 if (args->namelen != len)
69 return XFS_CMP_DIFFERENT;
70
71 result = XFS_CMP_EXACT;
72 for (i = 0; i < len; i++) {
73 if (args->name[i] == name[i])
74 continue;
75 if (tolower(args->name[i]) != tolower(name[i]))
76 return XFS_CMP_DIFFERENT;
77 result = XFS_CMP_CASE;
78 }
79
80 return result;
81 }
82
83 static struct xfs_nameops xfs_ascii_ci_nameops = {
84 .hashname = xfs_ascii_ci_hashname,
85 .compname = xfs_ascii_ci_compname,
86 };
87
88 int
xfs_da_mount(struct xfs_mount * mp)89 xfs_da_mount(
90 struct xfs_mount *mp)
91 {
92 struct xfs_da_geometry *dageo;
93 int nodehdr_size;
94
95
96 ASSERT(mp->m_sb.sb_versionnum & XFS_SB_VERSION_DIRV2BIT);
97 ASSERT((1 << (mp->m_sb.sb_blocklog + mp->m_sb.sb_dirblklog)) <=
98 XFS_MAX_BLOCKSIZE);
99
100 mp->m_dir_inode_ops = xfs_dir_get_ops(mp, NULL);
101 mp->m_nondir_inode_ops = xfs_nondir_get_ops(mp, NULL);
102
103 nodehdr_size = mp->m_dir_inode_ops->node_hdr_size;
104 mp->m_dir_geo = kmem_zalloc(sizeof(struct xfs_da_geometry),
105 KM_SLEEP | KM_MAYFAIL);
106 mp->m_attr_geo = kmem_zalloc(sizeof(struct xfs_da_geometry),
107 KM_SLEEP | KM_MAYFAIL);
108 if (!mp->m_dir_geo || !mp->m_attr_geo) {
109 kmem_free(mp->m_dir_geo);
110 kmem_free(mp->m_attr_geo);
111 return -ENOMEM;
112 }
113
114 /* set up directory geometry */
115 dageo = mp->m_dir_geo;
116 dageo->blklog = mp->m_sb.sb_blocklog + mp->m_sb.sb_dirblklog;
117 dageo->fsblog = mp->m_sb.sb_blocklog;
118 dageo->blksize = 1 << dageo->blklog;
119 dageo->fsbcount = 1 << mp->m_sb.sb_dirblklog;
120
121 /*
122 * Now we've set up the block conversion variables, we can calculate the
123 * segment block constants using the geometry structure.
124 */
125 dageo->datablk = xfs_dir2_byte_to_da(dageo, XFS_DIR2_DATA_OFFSET);
126 dageo->leafblk = xfs_dir2_byte_to_da(dageo, XFS_DIR2_LEAF_OFFSET);
127 dageo->freeblk = xfs_dir2_byte_to_da(dageo, XFS_DIR2_FREE_OFFSET);
128 dageo->node_ents = (dageo->blksize - nodehdr_size) /
129 (uint)sizeof(xfs_da_node_entry_t);
130 dageo->magicpct = (dageo->blksize * 37) / 100;
131
132 /* set up attribute geometry - single fsb only */
133 dageo = mp->m_attr_geo;
134 dageo->blklog = mp->m_sb.sb_blocklog;
135 dageo->fsblog = mp->m_sb.sb_blocklog;
136 dageo->blksize = 1 << dageo->blklog;
137 dageo->fsbcount = 1;
138 dageo->node_ents = (dageo->blksize - nodehdr_size) /
139 (uint)sizeof(xfs_da_node_entry_t);
140 dageo->magicpct = (dageo->blksize * 37) / 100;
141
142 if (xfs_sb_version_hasasciici(&mp->m_sb))
143 mp->m_dirnameops = &xfs_ascii_ci_nameops;
144 else
145 mp->m_dirnameops = &xfs_default_nameops;
146
147 return 0;
148 }
149
150 void
xfs_da_unmount(struct xfs_mount * mp)151 xfs_da_unmount(
152 struct xfs_mount *mp)
153 {
154 kmem_free(mp->m_dir_geo);
155 kmem_free(mp->m_attr_geo);
156 }
157
158 /*
159 * Return 1 if directory contains only "." and "..".
160 */
161 int
xfs_dir_isempty(xfs_inode_t * dp)162 xfs_dir_isempty(
163 xfs_inode_t *dp)
164 {
165 xfs_dir2_sf_hdr_t *sfp;
166
167 ASSERT(S_ISDIR(dp->i_d.di_mode));
168 if (dp->i_d.di_size == 0) /* might happen during shutdown. */
169 return 1;
170 if (dp->i_d.di_size > XFS_IFORK_DSIZE(dp))
171 return 0;
172 sfp = (xfs_dir2_sf_hdr_t *)dp->i_df.if_u1.if_data;
173 return !sfp->count;
174 }
175
176 /*
177 * Validate a given inode number.
178 */
179 int
xfs_dir_ino_validate(xfs_mount_t * mp,xfs_ino_t ino)180 xfs_dir_ino_validate(
181 xfs_mount_t *mp,
182 xfs_ino_t ino)
183 {
184 xfs_agblock_t agblkno;
185 xfs_agino_t agino;
186 xfs_agnumber_t agno;
187 int ino_ok;
188 int ioff;
189
190 agno = XFS_INO_TO_AGNO(mp, ino);
191 agblkno = XFS_INO_TO_AGBNO(mp, ino);
192 ioff = XFS_INO_TO_OFFSET(mp, ino);
193 agino = XFS_OFFBNO_TO_AGINO(mp, agblkno, ioff);
194 ino_ok =
195 agno < mp->m_sb.sb_agcount &&
196 agblkno < mp->m_sb.sb_agblocks &&
197 agblkno != 0 &&
198 ioff < (1 << mp->m_sb.sb_inopblog) &&
199 XFS_AGINO_TO_INO(mp, agno, agino) == ino;
200 if (unlikely(XFS_TEST_ERROR(!ino_ok, mp, XFS_ERRTAG_DIR_INO_VALIDATE,
201 XFS_RANDOM_DIR_INO_VALIDATE))) {
202 xfs_warn(mp, "Invalid inode number 0x%Lx",
203 (unsigned long long) ino);
204 XFS_ERROR_REPORT("xfs_dir_ino_validate", XFS_ERRLEVEL_LOW, mp);
205 return -EFSCORRUPTED;
206 }
207 return 0;
208 }
209
210 /*
211 * Initialize a directory with its "." and ".." entries.
212 */
213 int
xfs_dir_init(xfs_trans_t * tp,xfs_inode_t * dp,xfs_inode_t * pdp)214 xfs_dir_init(
215 xfs_trans_t *tp,
216 xfs_inode_t *dp,
217 xfs_inode_t *pdp)
218 {
219 struct xfs_da_args *args;
220 int error;
221
222 ASSERT(S_ISDIR(dp->i_d.di_mode));
223 error = xfs_dir_ino_validate(tp->t_mountp, pdp->i_ino);
224 if (error)
225 return error;
226
227 args = kmem_zalloc(sizeof(*args), KM_SLEEP | KM_NOFS);
228 if (!args)
229 return -ENOMEM;
230
231 args->geo = dp->i_mount->m_dir_geo;
232 args->dp = dp;
233 args->trans = tp;
234 error = xfs_dir2_sf_create(args, pdp->i_ino);
235 kmem_free(args);
236 return error;
237 }
238
239 /*
240 * Enter a name in a directory, or check for available space.
241 * If inum is 0, only the available space test is performed.
242 */
243 int
xfs_dir_createname(xfs_trans_t * tp,xfs_inode_t * dp,struct xfs_name * name,xfs_ino_t inum,xfs_fsblock_t * first,xfs_bmap_free_t * flist,xfs_extlen_t total)244 xfs_dir_createname(
245 xfs_trans_t *tp,
246 xfs_inode_t *dp,
247 struct xfs_name *name,
248 xfs_ino_t inum, /* new entry inode number */
249 xfs_fsblock_t *first, /* bmap's firstblock */
250 xfs_bmap_free_t *flist, /* bmap's freeblock list */
251 xfs_extlen_t total) /* bmap's total block count */
252 {
253 struct xfs_da_args *args;
254 int rval;
255 int v; /* type-checking value */
256
257 ASSERT(S_ISDIR(dp->i_d.di_mode));
258 if (inum) {
259 rval = xfs_dir_ino_validate(tp->t_mountp, inum);
260 if (rval)
261 return rval;
262 XFS_STATS_INC(xs_dir_create);
263 }
264
265 args = kmem_zalloc(sizeof(*args), KM_SLEEP | KM_NOFS);
266 if (!args)
267 return -ENOMEM;
268
269 args->geo = dp->i_mount->m_dir_geo;
270 args->name = name->name;
271 args->namelen = name->len;
272 args->filetype = name->type;
273 args->hashval = dp->i_mount->m_dirnameops->hashname(name);
274 args->inumber = inum;
275 args->dp = dp;
276 args->firstblock = first;
277 args->flist = flist;
278 args->total = total;
279 args->whichfork = XFS_DATA_FORK;
280 args->trans = tp;
281 args->op_flags = XFS_DA_OP_ADDNAME | XFS_DA_OP_OKNOENT;
282 if (!inum)
283 args->op_flags |= XFS_DA_OP_JUSTCHECK;
284
285 if (dp->i_d.di_format == XFS_DINODE_FMT_LOCAL) {
286 rval = xfs_dir2_sf_addname(args);
287 goto out_free;
288 }
289
290 rval = xfs_dir2_isblock(args, &v);
291 if (rval)
292 goto out_free;
293 if (v) {
294 rval = xfs_dir2_block_addname(args);
295 goto out_free;
296 }
297
298 rval = xfs_dir2_isleaf(args, &v);
299 if (rval)
300 goto out_free;
301 if (v)
302 rval = xfs_dir2_leaf_addname(args);
303 else
304 rval = xfs_dir2_node_addname(args);
305
306 out_free:
307 kmem_free(args);
308 return rval;
309 }
310
311 /*
312 * If doing a CI lookup and case-insensitive match, dup actual name into
313 * args.value. Return EEXIST for success (ie. name found) or an error.
314 */
315 int
xfs_dir_cilookup_result(struct xfs_da_args * args,const unsigned char * name,int len)316 xfs_dir_cilookup_result(
317 struct xfs_da_args *args,
318 const unsigned char *name,
319 int len)
320 {
321 if (args->cmpresult == XFS_CMP_DIFFERENT)
322 return -ENOENT;
323 if (args->cmpresult != XFS_CMP_CASE ||
324 !(args->op_flags & XFS_DA_OP_CILOOKUP))
325 return -EEXIST;
326
327 args->value = kmem_alloc(len, KM_NOFS | KM_MAYFAIL);
328 if (!args->value)
329 return -ENOMEM;
330
331 memcpy(args->value, name, len);
332 args->valuelen = len;
333 return -EEXIST;
334 }
335
336 /*
337 * Lookup a name in a directory, give back the inode number.
338 * If ci_name is not NULL, returns the actual name in ci_name if it differs
339 * to name, or ci_name->name is set to NULL for an exact match.
340 */
341
342 int
xfs_dir_lookup(xfs_trans_t * tp,xfs_inode_t * dp,struct xfs_name * name,xfs_ino_t * inum,struct xfs_name * ci_name)343 xfs_dir_lookup(
344 xfs_trans_t *tp,
345 xfs_inode_t *dp,
346 struct xfs_name *name,
347 xfs_ino_t *inum, /* out: inode number */
348 struct xfs_name *ci_name) /* out: actual name if CI match */
349 {
350 struct xfs_da_args *args;
351 int rval;
352 int v; /* type-checking value */
353
354 ASSERT(S_ISDIR(dp->i_d.di_mode));
355 XFS_STATS_INC(xs_dir_lookup);
356
357 /*
358 * We need to use KM_NOFS here so that lockdep will not throw false
359 * positive deadlock warnings on a non-transactional lookup path. It is
360 * safe to recurse into inode recalim in that case, but lockdep can't
361 * easily be taught about it. Hence KM_NOFS avoids having to add more
362 * lockdep Doing this avoids having to add a bunch of lockdep class
363 * annotations into the reclaim path for the ilock.
364 */
365 args = kmem_zalloc(sizeof(*args), KM_SLEEP | KM_NOFS);
366 args->geo = dp->i_mount->m_dir_geo;
367 args->name = name->name;
368 args->namelen = name->len;
369 args->filetype = name->type;
370 args->hashval = dp->i_mount->m_dirnameops->hashname(name);
371 args->dp = dp;
372 args->whichfork = XFS_DATA_FORK;
373 args->trans = tp;
374 args->op_flags = XFS_DA_OP_OKNOENT;
375 if (ci_name)
376 args->op_flags |= XFS_DA_OP_CILOOKUP;
377
378 if (dp->i_d.di_format == XFS_DINODE_FMT_LOCAL) {
379 rval = xfs_dir2_sf_lookup(args);
380 goto out_check_rval;
381 }
382
383 rval = xfs_dir2_isblock(args, &v);
384 if (rval)
385 goto out_free;
386 if (v) {
387 rval = xfs_dir2_block_lookup(args);
388 goto out_check_rval;
389 }
390
391 rval = xfs_dir2_isleaf(args, &v);
392 if (rval)
393 goto out_free;
394 if (v)
395 rval = xfs_dir2_leaf_lookup(args);
396 else
397 rval = xfs_dir2_node_lookup(args);
398
399 out_check_rval:
400 if (rval == -EEXIST)
401 rval = 0;
402 if (!rval) {
403 *inum = args->inumber;
404 if (ci_name) {
405 ci_name->name = args->value;
406 ci_name->len = args->valuelen;
407 }
408 }
409 out_free:
410 kmem_free(args);
411 return rval;
412 }
413
414 /*
415 * Remove an entry from a directory.
416 */
417 int
xfs_dir_removename(xfs_trans_t * tp,xfs_inode_t * dp,struct xfs_name * name,xfs_ino_t ino,xfs_fsblock_t * first,xfs_bmap_free_t * flist,xfs_extlen_t total)418 xfs_dir_removename(
419 xfs_trans_t *tp,
420 xfs_inode_t *dp,
421 struct xfs_name *name,
422 xfs_ino_t ino,
423 xfs_fsblock_t *first, /* bmap's firstblock */
424 xfs_bmap_free_t *flist, /* bmap's freeblock list */
425 xfs_extlen_t total) /* bmap's total block count */
426 {
427 struct xfs_da_args *args;
428 int rval;
429 int v; /* type-checking value */
430
431 ASSERT(S_ISDIR(dp->i_d.di_mode));
432 XFS_STATS_INC(xs_dir_remove);
433
434 args = kmem_zalloc(sizeof(*args), KM_SLEEP | KM_NOFS);
435 if (!args)
436 return -ENOMEM;
437
438 args->geo = dp->i_mount->m_dir_geo;
439 args->name = name->name;
440 args->namelen = name->len;
441 args->filetype = name->type;
442 args->hashval = dp->i_mount->m_dirnameops->hashname(name);
443 args->inumber = ino;
444 args->dp = dp;
445 args->firstblock = first;
446 args->flist = flist;
447 args->total = total;
448 args->whichfork = XFS_DATA_FORK;
449 args->trans = tp;
450
451 if (dp->i_d.di_format == XFS_DINODE_FMT_LOCAL) {
452 rval = xfs_dir2_sf_removename(args);
453 goto out_free;
454 }
455
456 rval = xfs_dir2_isblock(args, &v);
457 if (rval)
458 goto out_free;
459 if (v) {
460 rval = xfs_dir2_block_removename(args);
461 goto out_free;
462 }
463
464 rval = xfs_dir2_isleaf(args, &v);
465 if (rval)
466 goto out_free;
467 if (v)
468 rval = xfs_dir2_leaf_removename(args);
469 else
470 rval = xfs_dir2_node_removename(args);
471 out_free:
472 kmem_free(args);
473 return rval;
474 }
475
476 /*
477 * Replace the inode number of a directory entry.
478 */
479 int
xfs_dir_replace(xfs_trans_t * tp,xfs_inode_t * dp,struct xfs_name * name,xfs_ino_t inum,xfs_fsblock_t * first,xfs_bmap_free_t * flist,xfs_extlen_t total)480 xfs_dir_replace(
481 xfs_trans_t *tp,
482 xfs_inode_t *dp,
483 struct xfs_name *name, /* name of entry to replace */
484 xfs_ino_t inum, /* new inode number */
485 xfs_fsblock_t *first, /* bmap's firstblock */
486 xfs_bmap_free_t *flist, /* bmap's freeblock list */
487 xfs_extlen_t total) /* bmap's total block count */
488 {
489 struct xfs_da_args *args;
490 int rval;
491 int v; /* type-checking value */
492
493 ASSERT(S_ISDIR(dp->i_d.di_mode));
494
495 rval = xfs_dir_ino_validate(tp->t_mountp, inum);
496 if (rval)
497 return rval;
498
499 args = kmem_zalloc(sizeof(*args), KM_SLEEP | KM_NOFS);
500 if (!args)
501 return -ENOMEM;
502
503 args->geo = dp->i_mount->m_dir_geo;
504 args->name = name->name;
505 args->namelen = name->len;
506 args->filetype = name->type;
507 args->hashval = dp->i_mount->m_dirnameops->hashname(name);
508 args->inumber = inum;
509 args->dp = dp;
510 args->firstblock = first;
511 args->flist = flist;
512 args->total = total;
513 args->whichfork = XFS_DATA_FORK;
514 args->trans = tp;
515
516 if (dp->i_d.di_format == XFS_DINODE_FMT_LOCAL) {
517 rval = xfs_dir2_sf_replace(args);
518 goto out_free;
519 }
520
521 rval = xfs_dir2_isblock(args, &v);
522 if (rval)
523 goto out_free;
524 if (v) {
525 rval = xfs_dir2_block_replace(args);
526 goto out_free;
527 }
528
529 rval = xfs_dir2_isleaf(args, &v);
530 if (rval)
531 goto out_free;
532 if (v)
533 rval = xfs_dir2_leaf_replace(args);
534 else
535 rval = xfs_dir2_node_replace(args);
536 out_free:
537 kmem_free(args);
538 return rval;
539 }
540
541 /*
542 * See if this entry can be added to the directory without allocating space.
543 */
544 int
xfs_dir_canenter(xfs_trans_t * tp,xfs_inode_t * dp,struct xfs_name * name)545 xfs_dir_canenter(
546 xfs_trans_t *tp,
547 xfs_inode_t *dp,
548 struct xfs_name *name) /* name of entry to add */
549 {
550 return xfs_dir_createname(tp, dp, name, 0, NULL, NULL, 0);
551 }
552
553 /*
554 * Utility routines.
555 */
556
557 /*
558 * Add a block to the directory.
559 *
560 * This routine is for data and free blocks, not leaf/node blocks which are
561 * handled by xfs_da_grow_inode.
562 */
563 int
xfs_dir2_grow_inode(struct xfs_da_args * args,int space,xfs_dir2_db_t * dbp)564 xfs_dir2_grow_inode(
565 struct xfs_da_args *args,
566 int space, /* v2 dir's space XFS_DIR2_xxx_SPACE */
567 xfs_dir2_db_t *dbp) /* out: block number added */
568 {
569 struct xfs_inode *dp = args->dp;
570 struct xfs_mount *mp = dp->i_mount;
571 xfs_fileoff_t bno; /* directory offset of new block */
572 int count; /* count of filesystem blocks */
573 int error;
574
575 trace_xfs_dir2_grow_inode(args, space);
576
577 /*
578 * Set lowest possible block in the space requested.
579 */
580 bno = XFS_B_TO_FSBT(mp, space * XFS_DIR2_SPACE_SIZE);
581 count = args->geo->fsbcount;
582
583 error = xfs_da_grow_inode_int(args, &bno, count);
584 if (error)
585 return error;
586
587 *dbp = xfs_dir2_da_to_db(args->geo, (xfs_dablk_t)bno);
588
589 /*
590 * Update file's size if this is the data space and it grew.
591 */
592 if (space == XFS_DIR2_DATA_SPACE) {
593 xfs_fsize_t size; /* directory file (data) size */
594
595 size = XFS_FSB_TO_B(mp, bno + count);
596 if (size > dp->i_d.di_size) {
597 dp->i_d.di_size = size;
598 xfs_trans_log_inode(args->trans, dp, XFS_ILOG_CORE);
599 }
600 }
601 return 0;
602 }
603
604 /*
605 * See if the directory is a single-block form directory.
606 */
607 int
xfs_dir2_isblock(struct xfs_da_args * args,int * vp)608 xfs_dir2_isblock(
609 struct xfs_da_args *args,
610 int *vp) /* out: 1 is block, 0 is not block */
611 {
612 xfs_fileoff_t last; /* last file offset */
613 int rval;
614
615 if ((rval = xfs_bmap_last_offset(args->dp, &last, XFS_DATA_FORK)))
616 return rval;
617 rval = XFS_FSB_TO_B(args->dp->i_mount, last) == args->geo->blksize;
618 ASSERT(rval == 0 || args->dp->i_d.di_size == args->geo->blksize);
619 *vp = rval;
620 return 0;
621 }
622
623 /*
624 * See if the directory is a single-leaf form directory.
625 */
626 int
xfs_dir2_isleaf(struct xfs_da_args * args,int * vp)627 xfs_dir2_isleaf(
628 struct xfs_da_args *args,
629 int *vp) /* out: 1 is block, 0 is not block */
630 {
631 xfs_fileoff_t last; /* last file offset */
632 int rval;
633
634 if ((rval = xfs_bmap_last_offset(args->dp, &last, XFS_DATA_FORK)))
635 return rval;
636 *vp = last == args->geo->leafblk + args->geo->fsbcount;
637 return 0;
638 }
639
640 /*
641 * Remove the given block from the directory.
642 * This routine is used for data and free blocks, leaf/node are done
643 * by xfs_da_shrink_inode.
644 */
645 int
xfs_dir2_shrink_inode(xfs_da_args_t * args,xfs_dir2_db_t db,struct xfs_buf * bp)646 xfs_dir2_shrink_inode(
647 xfs_da_args_t *args,
648 xfs_dir2_db_t db,
649 struct xfs_buf *bp)
650 {
651 xfs_fileoff_t bno; /* directory file offset */
652 xfs_dablk_t da; /* directory file offset */
653 int done; /* bunmap is finished */
654 xfs_inode_t *dp;
655 int error;
656 xfs_mount_t *mp;
657 xfs_trans_t *tp;
658
659 trace_xfs_dir2_shrink_inode(args, db);
660
661 dp = args->dp;
662 mp = dp->i_mount;
663 tp = args->trans;
664 da = xfs_dir2_db_to_da(args->geo, db);
665 /*
666 * Unmap the fsblock(s).
667 */
668 if ((error = xfs_bunmapi(tp, dp, da, args->geo->fsbcount,
669 XFS_BMAPI_METADATA, 0, args->firstblock, args->flist,
670 &done))) {
671 /*
672 * ENOSPC actually can happen if we're in a removename with
673 * no space reservation, and the resulting block removal
674 * would cause a bmap btree split or conversion from extents
675 * to btree. This can only happen for un-fragmented
676 * directory blocks, since you need to be punching out
677 * the middle of an extent.
678 * In this case we need to leave the block in the file,
679 * and not binval it.
680 * So the block has to be in a consistent empty state
681 * and appropriately logged.
682 * We don't free up the buffer, the caller can tell it
683 * hasn't happened since it got an error back.
684 */
685 return error;
686 }
687 ASSERT(done);
688 /*
689 * Invalidate the buffer from the transaction.
690 */
691 xfs_trans_binval(tp, bp);
692 /*
693 * If it's not a data block, we're done.
694 */
695 if (db >= xfs_dir2_byte_to_db(args->geo, XFS_DIR2_LEAF_OFFSET))
696 return 0;
697 /*
698 * If the block isn't the last one in the directory, we're done.
699 */
700 if (dp->i_d.di_size > xfs_dir2_db_off_to_byte(args->geo, db + 1, 0))
701 return 0;
702 bno = da;
703 if ((error = xfs_bmap_last_before(tp, dp, &bno, XFS_DATA_FORK))) {
704 /*
705 * This can't really happen unless there's kernel corruption.
706 */
707 return error;
708 }
709 if (db == args->geo->datablk)
710 ASSERT(bno == 0);
711 else
712 ASSERT(bno > 0);
713 /*
714 * Set the size to the new last block.
715 */
716 dp->i_d.di_size = XFS_FSB_TO_B(mp, bno);
717 xfs_trans_log_inode(tp, dp, XFS_ILOG_CORE);
718 return 0;
719 }
720