2 * Copyright (c) 2000-2001,2005 Silicon Graphics, Inc.
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.
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.
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
20 #include "xfs_types.h"
24 #include "xfs_trans.h"
28 #include "xfs_dmapi.h"
29 #include "xfs_mount.h"
30 #include "xfs_da_btree.h"
31 #include "xfs_bmap_btree.h"
32 #include "xfs_alloc_btree.h"
33 #include "xfs_dir2_sf.h"
34 #include "xfs_attr_sf.h"
35 #include "xfs_dinode.h"
36 #include "xfs_inode.h"
37 #include "xfs_inode_item.h"
39 #include "xfs_dir2_data.h"
40 #include "xfs_dir2_leaf.h"
41 #include "xfs_dir2_block.h"
42 #include "xfs_dir2_node.h"
43 #include "xfs_dir2_trace.h"
44 #include "xfs_error.h"
45 #include "xfs_vnodeops.h"
47 struct xfs_name xfs_name_dotdot
= {"..", 2};
53 ASSERT(xfs_sb_version_hasdirv2(&mp
->m_sb
));
54 ASSERT((1 << (mp
->m_sb
.sb_blocklog
+ mp
->m_sb
.sb_dirblklog
)) <=
56 mp
->m_dirblksize
= 1 << (mp
->m_sb
.sb_blocklog
+ mp
->m_sb
.sb_dirblklog
);
57 mp
->m_dirblkfsbs
= 1 << mp
->m_sb
.sb_dirblklog
;
58 mp
->m_dirdatablk
= xfs_dir2_db_to_da(mp
, XFS_DIR2_DATA_FIRSTDB(mp
));
59 mp
->m_dirleafblk
= xfs_dir2_db_to_da(mp
, XFS_DIR2_LEAF_FIRSTDB(mp
));
60 mp
->m_dirfreeblk
= xfs_dir2_db_to_da(mp
, XFS_DIR2_FREE_FIRSTDB(mp
));
61 mp
->m_attr_node_ents
=
62 (mp
->m_sb
.sb_blocksize
- (uint
)sizeof(xfs_da_node_hdr_t
)) /
63 (uint
)sizeof(xfs_da_node_entry_t
);
65 (mp
->m_dirblksize
- (uint
)sizeof(xfs_da_node_hdr_t
)) /
66 (uint
)sizeof(xfs_da_node_entry_t
);
67 mp
->m_dir_magicpct
= (mp
->m_dirblksize
* 37) / 100;
71 * Return 1 if directory contains only "." and "..".
79 ASSERT((dp
->i_d
.di_mode
& S_IFMT
) == S_IFDIR
);
80 if (dp
->i_d
.di_size
== 0) /* might happen during shutdown. */
82 if (dp
->i_d
.di_size
> XFS_IFORK_DSIZE(dp
))
84 sfp
= (xfs_dir2_sf_t
*)dp
->i_df
.if_u1
.if_data
;
85 return !sfp
->hdr
.count
;
89 * Validate a given inode number.
96 xfs_agblock_t agblkno
;
102 agno
= XFS_INO_TO_AGNO(mp
, ino
);
103 agblkno
= XFS_INO_TO_AGBNO(mp
, ino
);
104 ioff
= XFS_INO_TO_OFFSET(mp
, ino
);
105 agino
= XFS_OFFBNO_TO_AGINO(mp
, agblkno
, ioff
);
107 agno
< mp
->m_sb
.sb_agcount
&&
108 agblkno
< mp
->m_sb
.sb_agblocks
&&
110 ioff
< (1 << mp
->m_sb
.sb_inopblog
) &&
111 XFS_AGINO_TO_INO(mp
, agno
, agino
) == ino
;
112 if (unlikely(XFS_TEST_ERROR(!ino_ok
, mp
, XFS_ERRTAG_DIR_INO_VALIDATE
,
113 XFS_RANDOM_DIR_INO_VALIDATE
))) {
114 xfs_fs_cmn_err(CE_WARN
, mp
, "Invalid inode number 0x%Lx",
115 (unsigned long long) ino
);
116 XFS_ERROR_REPORT("xfs_dir_ino_validate", XFS_ERRLEVEL_LOW
, mp
);
117 return XFS_ERROR(EFSCORRUPTED
);
123 * Initialize a directory with its "." and ".." entries.
134 memset((char *)&args
, 0, sizeof(args
));
137 ASSERT((dp
->i_d
.di_mode
& S_IFMT
) == S_IFDIR
);
138 if ((error
= xfs_dir_ino_validate(tp
->t_mountp
, pdp
->i_ino
)))
140 return xfs_dir2_sf_create(&args
, pdp
->i_ino
);
144 Enter a name in a directory.
150 struct xfs_name
*name
,
151 xfs_ino_t inum
, /* new entry inode number */
152 xfs_fsblock_t
*first
, /* bmap's firstblock */
153 xfs_bmap_free_t
*flist
, /* bmap's freeblock list */
154 xfs_extlen_t total
) /* bmap's total block count */
158 int v
; /* type-checking value */
160 ASSERT((dp
->i_d
.di_mode
& S_IFMT
) == S_IFDIR
);
161 if ((rval
= xfs_dir_ino_validate(tp
->t_mountp
, inum
)))
163 XFS_STATS_INC(xs_dir_create
);
165 args
.name
= name
->name
;
166 args
.namelen
= name
->len
;
167 args
.hashval
= xfs_da_hashname(name
->name
, name
->len
);
170 args
.firstblock
= first
;
173 args
.whichfork
= XFS_DATA_FORK
;
176 args
.addname
= args
.oknoent
= 1;
178 if (dp
->i_d
.di_format
== XFS_DINODE_FMT_LOCAL
)
179 rval
= xfs_dir2_sf_addname(&args
);
180 else if ((rval
= xfs_dir2_isblock(tp
, dp
, &v
)))
183 rval
= xfs_dir2_block_addname(&args
);
184 else if ((rval
= xfs_dir2_isleaf(tp
, dp
, &v
)))
187 rval
= xfs_dir2_leaf_addname(&args
);
189 rval
= xfs_dir2_node_addname(&args
);
194 * Lookup a name in a directory, give back the inode number.
200 struct xfs_name
*name
,
201 xfs_ino_t
*inum
) /* out: inode number */
205 int v
; /* type-checking value */
207 ASSERT((dp
->i_d
.di_mode
& S_IFMT
) == S_IFDIR
);
208 XFS_STATS_INC(xs_dir_lookup
);
209 memset(&args
, 0, sizeof(xfs_da_args_t
));
211 args
.name
= name
->name
;
212 args
.namelen
= name
->len
;
213 args
.hashval
= xfs_da_hashname(name
->name
, name
->len
);
215 args
.whichfork
= XFS_DATA_FORK
;
219 if (dp
->i_d
.di_format
== XFS_DINODE_FMT_LOCAL
)
220 rval
= xfs_dir2_sf_lookup(&args
);
221 else if ((rval
= xfs_dir2_isblock(tp
, dp
, &v
)))
224 rval
= xfs_dir2_block_lookup(&args
);
225 else if ((rval
= xfs_dir2_isleaf(tp
, dp
, &v
)))
228 rval
= xfs_dir2_leaf_lookup(&args
);
230 rval
= xfs_dir2_node_lookup(&args
);
234 *inum
= args
.inumber
;
239 * Remove an entry from a directory.
245 struct xfs_name
*name
,
247 xfs_fsblock_t
*first
, /* bmap's firstblock */
248 xfs_bmap_free_t
*flist
, /* bmap's freeblock list */
249 xfs_extlen_t total
) /* bmap's total block count */
253 int v
; /* type-checking value */
255 ASSERT((dp
->i_d
.di_mode
& S_IFMT
) == S_IFDIR
);
256 XFS_STATS_INC(xs_dir_remove
);
258 args
.name
= name
->name
;
259 args
.namelen
= name
->len
;
260 args
.hashval
= xfs_da_hashname(name
->name
, name
->len
);
263 args
.firstblock
= first
;
266 args
.whichfork
= XFS_DATA_FORK
;
268 args
.justcheck
= args
.addname
= args
.oknoent
= 0;
270 if (dp
->i_d
.di_format
== XFS_DINODE_FMT_LOCAL
)
271 rval
= xfs_dir2_sf_removename(&args
);
272 else if ((rval
= xfs_dir2_isblock(tp
, dp
, &v
)))
275 rval
= xfs_dir2_block_removename(&args
);
276 else if ((rval
= xfs_dir2_isleaf(tp
, dp
, &v
)))
279 rval
= xfs_dir2_leaf_removename(&args
);
281 rval
= xfs_dir2_node_removename(&args
);
296 int rval
; /* return value */
297 int v
; /* type-checking value */
299 xfs_itrace_entry(dp
);
301 if (XFS_FORCED_SHUTDOWN(dp
->i_mount
))
302 return XFS_ERROR(EIO
);
304 ASSERT((dp
->i_d
.di_mode
& S_IFMT
) == S_IFDIR
);
305 XFS_STATS_INC(xs_dir_getdents
);
307 if (dp
->i_d
.di_format
== XFS_DINODE_FMT_LOCAL
)
308 rval
= xfs_dir2_sf_getdents(dp
, dirent
, offset
, filldir
);
309 else if ((rval
= xfs_dir2_isblock(NULL
, dp
, &v
)))
312 rval
= xfs_dir2_block_getdents(dp
, dirent
, offset
, filldir
);
314 rval
= xfs_dir2_leaf_getdents(dp
, dirent
, bufsize
, offset
,
320 * Replace the inode number of a directory entry.
326 struct xfs_name
*name
, /* name of entry to replace */
327 xfs_ino_t inum
, /* new inode number */
328 xfs_fsblock_t
*first
, /* bmap's firstblock */
329 xfs_bmap_free_t
*flist
, /* bmap's freeblock list */
330 xfs_extlen_t total
) /* bmap's total block count */
334 int v
; /* type-checking value */
336 ASSERT((dp
->i_d
.di_mode
& S_IFMT
) == S_IFDIR
);
338 if ((rval
= xfs_dir_ino_validate(tp
->t_mountp
, inum
)))
341 args
.name
= name
->name
;
342 args
.namelen
= name
->len
;
343 args
.hashval
= xfs_da_hashname(name
->name
, name
->len
);
346 args
.firstblock
= first
;
349 args
.whichfork
= XFS_DATA_FORK
;
351 args
.justcheck
= args
.addname
= args
.oknoent
= 0;
353 if (dp
->i_d
.di_format
== XFS_DINODE_FMT_LOCAL
)
354 rval
= xfs_dir2_sf_replace(&args
);
355 else if ((rval
= xfs_dir2_isblock(tp
, dp
, &v
)))
358 rval
= xfs_dir2_block_replace(&args
);
359 else if ((rval
= xfs_dir2_isleaf(tp
, dp
, &v
)))
362 rval
= xfs_dir2_leaf_replace(&args
);
364 rval
= xfs_dir2_node_replace(&args
);
369 * See if this entry can be added to the directory without allocating space.
370 * First checks that the caller couldn't reserve enough space (resblks = 0).
376 struct xfs_name
*name
, /* name of entry to add */
381 int v
; /* type-checking value */
386 ASSERT((dp
->i_d
.di_mode
& S_IFMT
) == S_IFDIR
);
387 memset(&args
, 0, sizeof(xfs_da_args_t
));
389 args
.name
= name
->name
;
390 args
.namelen
= name
->len
;
391 args
.hashval
= xfs_da_hashname(name
->name
, name
->len
);
393 args
.whichfork
= XFS_DATA_FORK
;
395 args
.justcheck
= args
.addname
= args
.oknoent
= 1;
397 if (dp
->i_d
.di_format
== XFS_DINODE_FMT_LOCAL
)
398 rval
= xfs_dir2_sf_addname(&args
);
399 else if ((rval
= xfs_dir2_isblock(tp
, dp
, &v
)))
402 rval
= xfs_dir2_block_addname(&args
);
403 else if ((rval
= xfs_dir2_isleaf(tp
, dp
, &v
)))
406 rval
= xfs_dir2_leaf_addname(&args
);
408 rval
= xfs_dir2_node_addname(&args
);
417 * Add a block to the directory.
418 * This routine is for data and free blocks, not leaf/node blocks
419 * which are handled by xfs_da_grow_inode.
424 int space
, /* v2 dir's space XFS_DIR2_xxx_SPACE */
425 xfs_dir2_db_t
*dbp
) /* out: block number added */
427 xfs_fileoff_t bno
; /* directory offset of new block */
428 int count
; /* count of filesystem blocks */
429 xfs_inode_t
*dp
; /* incore directory inode */
431 int got
; /* blocks actually mapped */
433 xfs_bmbt_irec_t map
; /* single structure for bmap */
434 int mapi
; /* mapping index */
435 xfs_bmbt_irec_t
*mapp
; /* bmap mapping structure(s) */
437 int nmap
; /* number of bmap entries */
440 xfs_dir2_trace_args_s("grow_inode", args
, space
);
445 * Set lowest possible block in the space requested.
447 bno
= XFS_B_TO_FSBT(mp
, space
* XFS_DIR2_SPACE_SIZE
);
448 count
= mp
->m_dirblkfsbs
;
450 * Find the first hole for our block.
452 if ((error
= xfs_bmap_first_unused(tp
, dp
, count
, &bno
, XFS_DATA_FORK
)))
455 ASSERT(args
->firstblock
!= NULL
);
457 * Try mapping the new block contiguously (one extent).
459 if ((error
= xfs_bmapi(tp
, dp
, bno
, count
,
460 XFS_BMAPI_WRITE
|XFS_BMAPI_METADATA
|XFS_BMAPI_CONTIG
,
461 args
->firstblock
, args
->total
, &map
, &nmap
,
470 * Didn't work and this is a multiple-fsb directory block.
471 * Try again with contiguous flag turned on.
473 else if (nmap
== 0 && count
> 1) {
474 xfs_fileoff_t b
; /* current file offset */
477 * Space for maximum number of mappings.
479 mapp
= kmem_alloc(sizeof(*mapp
) * count
, KM_SLEEP
);
481 * Iterate until we get to the end of our block.
483 for (b
= bno
, mapi
= 0; b
< bno
+ count
; ) {
484 int c
; /* current fsb count */
487 * Can't map more than MAX_NMAP at once.
489 nmap
= MIN(XFS_BMAP_MAX_NMAP
, count
);
490 c
= (int)(bno
+ count
- b
);
491 if ((error
= xfs_bmapi(tp
, dp
, b
, c
,
492 XFS_BMAPI_WRITE
|XFS_BMAPI_METADATA
,
493 args
->firstblock
, args
->total
,
494 &mapp
[mapi
], &nmap
, args
->flist
,
496 kmem_free(mapp
, sizeof(*mapp
) * count
);
502 * Add this bunch into our table, go to the next offset.
505 b
= mapp
[mapi
- 1].br_startoff
+
506 mapp
[mapi
- 1].br_blockcount
;
517 * See how many fsb's we got.
519 for (i
= 0, got
= 0; i
< mapi
; i
++)
520 got
+= mapp
[i
].br_blockcount
;
522 * Didn't get enough fsb's, or the first/last block's are wrong.
524 if (got
!= count
|| mapp
[0].br_startoff
!= bno
||
525 mapp
[mapi
- 1].br_startoff
+ mapp
[mapi
- 1].br_blockcount
!=
528 kmem_free(mapp
, sizeof(*mapp
) * count
);
529 return XFS_ERROR(ENOSPC
);
532 * Done with the temporary mapping table.
535 kmem_free(mapp
, sizeof(*mapp
) * count
);
536 *dbp
= xfs_dir2_da_to_db(mp
, (xfs_dablk_t
)bno
);
538 * Update file's size if this is the data space and it grew.
540 if (space
== XFS_DIR2_DATA_SPACE
) {
541 xfs_fsize_t size
; /* directory file (data) size */
543 size
= XFS_FSB_TO_B(mp
, bno
+ count
);
544 if (size
> dp
->i_d
.di_size
) {
545 dp
->i_d
.di_size
= size
;
546 xfs_trans_log_inode(tp
, dp
, XFS_ILOG_CORE
);
553 * See if the directory is a single-block form directory.
559 int *vp
) /* out: 1 is block, 0 is not block */
561 xfs_fileoff_t last
; /* last file offset */
566 if ((rval
= xfs_bmap_last_offset(tp
, dp
, &last
, XFS_DATA_FORK
)))
568 rval
= XFS_FSB_TO_B(mp
, last
) == mp
->m_dirblksize
;
569 ASSERT(rval
== 0 || dp
->i_d
.di_size
== mp
->m_dirblksize
);
575 * See if the directory is a single-leaf form directory.
581 int *vp
) /* out: 1 is leaf, 0 is not leaf */
583 xfs_fileoff_t last
; /* last file offset */
588 if ((rval
= xfs_bmap_last_offset(tp
, dp
, &last
, XFS_DATA_FORK
)))
590 *vp
= last
== mp
->m_dirleafblk
+ (1 << mp
->m_sb
.sb_dirblklog
);
595 * Remove the given block from the directory.
596 * This routine is used for data and free blocks, leaf/node are done
597 * by xfs_da_shrink_inode.
600 xfs_dir2_shrink_inode(
605 xfs_fileoff_t bno
; /* directory file offset */
606 xfs_dablk_t da
; /* directory file offset */
607 int done
; /* bunmap is finished */
613 xfs_dir2_trace_args_db("shrink_inode", args
, db
, bp
);
617 da
= xfs_dir2_db_to_da(mp
, db
);
619 * Unmap the fsblock(s).
621 if ((error
= xfs_bunmapi(tp
, dp
, da
, mp
->m_dirblkfsbs
,
622 XFS_BMAPI_METADATA
, 0, args
->firstblock
, args
->flist
,
625 * ENOSPC actually can happen if we're in a removename with
626 * no space reservation, and the resulting block removal
627 * would cause a bmap btree split or conversion from extents
628 * to btree. This can only happen for un-fragmented
629 * directory blocks, since you need to be punching out
630 * the middle of an extent.
631 * In this case we need to leave the block in the file,
633 * So the block has to be in a consistent empty state
634 * and appropriately logged.
635 * We don't free up the buffer, the caller can tell it
636 * hasn't happened since it got an error back.
642 * Invalidate the buffer from the transaction.
644 xfs_da_binval(tp
, bp
);
646 * If it's not a data block, we're done.
648 if (db
>= XFS_DIR2_LEAF_FIRSTDB(mp
))
651 * If the block isn't the last one in the directory, we're done.
653 if (dp
->i_d
.di_size
> xfs_dir2_db_off_to_byte(mp
, db
+ 1, 0))
656 if ((error
= xfs_bmap_last_before(tp
, dp
, &bno
, XFS_DATA_FORK
))) {
658 * This can't really happen unless there's kernel corruption.
662 if (db
== mp
->m_dirdatablk
)
667 * Set the size to the new last block.
669 dp
->i_d
.di_size
= XFS_FSB_TO_B(mp
, bno
);
670 xfs_trans_log_inode(tp
, dp
, XFS_ILOG_CORE
);