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