xfs_dir2.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630
  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_log.h"
  22. #include "xfs_inum.h"
  23. #include "xfs_trans.h"
  24. #include "xfs_sb.h"
  25. #include "xfs_ag.h"
  26. #include "xfs_mount.h"
  27. #include "xfs_da_btree.h"
  28. #include "xfs_bmap_btree.h"
  29. #include "xfs_alloc_btree.h"
  30. #include "xfs_dinode.h"
  31. #include "xfs_inode.h"
  32. #include "xfs_inode_item.h"
  33. #include "xfs_bmap.h"
  34. #include "xfs_dir2_format.h"
  35. #include "xfs_dir2.h"
  36. #include "xfs_dir2_priv.h"
  37. #include "xfs_error.h"
  38. #include "xfs_trace.h"
  39. struct xfs_name xfs_name_dotdot = { (unsigned char *)"..", 2};
  40. /*
  41. * ASCII case-insensitive (ie. A-Z) support for directories that was
  42. * used in IRIX.
  43. */
  44. STATIC xfs_dahash_t
  45. xfs_ascii_ci_hashname(
  46. struct xfs_name *name)
  47. {
  48. xfs_dahash_t hash;
  49. int i;
  50. for (i = 0, hash = 0; i < name->len; i++)
  51. hash = tolower(name->name[i]) ^ rol32(hash, 7);
  52. return hash;
  53. }
  54. STATIC enum xfs_dacmp
  55. xfs_ascii_ci_compname(
  56. struct xfs_da_args *args,
  57. const unsigned char *name,
  58. int len)
  59. {
  60. enum xfs_dacmp result;
  61. int i;
  62. if (args->namelen != len)
  63. return XFS_CMP_DIFFERENT;
  64. result = XFS_CMP_EXACT;
  65. for (i = 0; i < len; i++) {
  66. if (args->name[i] == name[i])
  67. continue;
  68. if (tolower(args->name[i]) != tolower(name[i]))
  69. return XFS_CMP_DIFFERENT;
  70. result = XFS_CMP_CASE;
  71. }
  72. return result;
  73. }
  74. static struct xfs_nameops xfs_ascii_ci_nameops = {
  75. .hashname = xfs_ascii_ci_hashname,
  76. .compname = xfs_ascii_ci_compname,
  77. };
  78. void
  79. xfs_dir_mount(
  80. xfs_mount_t *mp)
  81. {
  82. ASSERT(xfs_sb_version_hasdirv2(&mp->m_sb));
  83. ASSERT((1 << (mp->m_sb.sb_blocklog + mp->m_sb.sb_dirblklog)) <=
  84. XFS_MAX_BLOCKSIZE);
  85. mp->m_dirblksize = 1 << (mp->m_sb.sb_blocklog + mp->m_sb.sb_dirblklog);
  86. mp->m_dirblkfsbs = 1 << mp->m_sb.sb_dirblklog;
  87. mp->m_dirdatablk = xfs_dir2_db_to_da(mp, XFS_DIR2_DATA_FIRSTDB(mp));
  88. mp->m_dirleafblk = xfs_dir2_db_to_da(mp, XFS_DIR2_LEAF_FIRSTDB(mp));
  89. mp->m_dirfreeblk = xfs_dir2_db_to_da(mp, XFS_DIR2_FREE_FIRSTDB(mp));
  90. mp->m_attr_node_ents =
  91. (mp->m_sb.sb_blocksize - (uint)sizeof(xfs_da_node_hdr_t)) /
  92. (uint)sizeof(xfs_da_node_entry_t);
  93. mp->m_dir_node_ents =
  94. (mp->m_dirblksize - (uint)sizeof(xfs_da_node_hdr_t)) /
  95. (uint)sizeof(xfs_da_node_entry_t);
  96. mp->m_dir_magicpct = (mp->m_dirblksize * 37) / 100;
  97. if (xfs_sb_version_hasasciici(&mp->m_sb))
  98. mp->m_dirnameops = &xfs_ascii_ci_nameops;
  99. else
  100. mp->m_dirnameops = &xfs_default_nameops;
  101. }
  102. /*
  103. * Return 1 if directory contains only "." and "..".
  104. */
  105. int
  106. xfs_dir_isempty(
  107. xfs_inode_t *dp)
  108. {
  109. xfs_dir2_sf_hdr_t *sfp;
  110. ASSERT(S_ISDIR(dp->i_d.di_mode));
  111. if (dp->i_d.di_size == 0) /* might happen during shutdown. */
  112. return 1;
  113. if (dp->i_d.di_size > XFS_IFORK_DSIZE(dp))
  114. return 0;
  115. sfp = (xfs_dir2_sf_hdr_t *)dp->i_df.if_u1.if_data;
  116. return !sfp->count;
  117. }
  118. /*
  119. * Validate a given inode number.
  120. */
  121. int
  122. xfs_dir_ino_validate(
  123. xfs_mount_t *mp,
  124. xfs_ino_t ino)
  125. {
  126. xfs_agblock_t agblkno;
  127. xfs_agino_t agino;
  128. xfs_agnumber_t agno;
  129. int ino_ok;
  130. int ioff;
  131. agno = XFS_INO_TO_AGNO(mp, ino);
  132. agblkno = XFS_INO_TO_AGBNO(mp, ino);
  133. ioff = XFS_INO_TO_OFFSET(mp, ino);
  134. agino = XFS_OFFBNO_TO_AGINO(mp, agblkno, ioff);
  135. ino_ok =
  136. agno < mp->m_sb.sb_agcount &&
  137. agblkno < mp->m_sb.sb_agblocks &&
  138. agblkno != 0 &&
  139. ioff < (1 << mp->m_sb.sb_inopblog) &&
  140. XFS_AGINO_TO_INO(mp, agno, agino) == ino;
  141. if (unlikely(XFS_TEST_ERROR(!ino_ok, mp, XFS_ERRTAG_DIR_INO_VALIDATE,
  142. XFS_RANDOM_DIR_INO_VALIDATE))) {
  143. xfs_warn(mp, "Invalid inode number 0x%Lx",
  144. (unsigned long long) ino);
  145. XFS_ERROR_REPORT("xfs_dir_ino_validate", XFS_ERRLEVEL_LOW, mp);
  146. return XFS_ERROR(EFSCORRUPTED);
  147. }
  148. return 0;
  149. }
  150. /*
  151. * Initialize a directory with its "." and ".." entries.
  152. */
  153. int
  154. xfs_dir_init(
  155. xfs_trans_t *tp,
  156. xfs_inode_t *dp,
  157. xfs_inode_t *pdp)
  158. {
  159. xfs_da_args_t args;
  160. int error;
  161. memset((char *)&args, 0, sizeof(args));
  162. args.dp = dp;
  163. args.trans = tp;
  164. ASSERT(S_ISDIR(dp->i_d.di_mode));
  165. if ((error = xfs_dir_ino_validate(tp->t_mountp, pdp->i_ino)))
  166. return error;
  167. return xfs_dir2_sf_create(&args, pdp->i_ino);
  168. }
  169. /*
  170. Enter a name in a directory.
  171. */
  172. int
  173. xfs_dir_createname(
  174. xfs_trans_t *tp,
  175. xfs_inode_t *dp,
  176. struct xfs_name *name,
  177. xfs_ino_t inum, /* new entry inode number */
  178. xfs_fsblock_t *first, /* bmap's firstblock */
  179. xfs_bmap_free_t *flist, /* bmap's freeblock list */
  180. xfs_extlen_t total) /* bmap's total block count */
  181. {
  182. xfs_da_args_t args;
  183. int rval;
  184. int v; /* type-checking value */
  185. ASSERT(S_ISDIR(dp->i_d.di_mode));
  186. if ((rval = xfs_dir_ino_validate(tp->t_mountp, inum)))
  187. return rval;
  188. XFS_STATS_INC(xs_dir_create);
  189. memset(&args, 0, sizeof(xfs_da_args_t));
  190. args.name = name->name;
  191. args.namelen = name->len;
  192. args.hashval = dp->i_mount->m_dirnameops->hashname(name);
  193. args.inumber = inum;
  194. args.dp = dp;
  195. args.firstblock = first;
  196. args.flist = flist;
  197. args.total = total;
  198. args.whichfork = XFS_DATA_FORK;
  199. args.trans = tp;
  200. args.op_flags = XFS_DA_OP_ADDNAME | XFS_DA_OP_OKNOENT;
  201. if (dp->i_d.di_format == XFS_DINODE_FMT_LOCAL)
  202. rval = xfs_dir2_sf_addname(&args);
  203. else if ((rval = xfs_dir2_isblock(tp, dp, &v)))
  204. return rval;
  205. else if (v)
  206. rval = xfs_dir2_block_addname(&args);
  207. else if ((rval = xfs_dir2_isleaf(tp, dp, &v)))
  208. return rval;
  209. else if (v)
  210. rval = xfs_dir2_leaf_addname(&args);
  211. else
  212. rval = xfs_dir2_node_addname(&args);
  213. return rval;
  214. }
  215. /*
  216. * If doing a CI lookup and case-insensitive match, dup actual name into
  217. * args.value. Return EEXIST for success (ie. name found) or an error.
  218. */
  219. int
  220. xfs_dir_cilookup_result(
  221. struct xfs_da_args *args,
  222. const unsigned char *name,
  223. int len)
  224. {
  225. if (args->cmpresult == XFS_CMP_DIFFERENT)
  226. return ENOENT;
  227. if (args->cmpresult != XFS_CMP_CASE ||
  228. !(args->op_flags & XFS_DA_OP_CILOOKUP))
  229. return EEXIST;
  230. args->value = kmem_alloc(len, KM_NOFS | KM_MAYFAIL);
  231. if (!args->value)
  232. return ENOMEM;
  233. memcpy(args->value, name, len);
  234. args->valuelen = len;
  235. return EEXIST;
  236. }
  237. /*
  238. * Lookup a name in a directory, give back the inode number.
  239. * If ci_name is not NULL, returns the actual name in ci_name if it differs
  240. * to name, or ci_name->name is set to NULL for an exact match.
  241. */
  242. int
  243. xfs_dir_lookup(
  244. xfs_trans_t *tp,
  245. xfs_inode_t *dp,
  246. struct xfs_name *name,
  247. xfs_ino_t *inum, /* out: inode number */
  248. struct xfs_name *ci_name) /* out: actual name if CI match */
  249. {
  250. xfs_da_args_t args;
  251. int rval;
  252. int v; /* type-checking value */
  253. ASSERT(S_ISDIR(dp->i_d.di_mode));
  254. XFS_STATS_INC(xs_dir_lookup);
  255. memset(&args, 0, sizeof(xfs_da_args_t));
  256. args.name = name->name;
  257. args.namelen = name->len;
  258. args.hashval = dp->i_mount->m_dirnameops->hashname(name);
  259. args.dp = dp;
  260. args.whichfork = XFS_DATA_FORK;
  261. args.trans = tp;
  262. args.op_flags = XFS_DA_OP_OKNOENT;
  263. if (ci_name)
  264. args.op_flags |= XFS_DA_OP_CILOOKUP;
  265. if (dp->i_d.di_format == XFS_DINODE_FMT_LOCAL)
  266. rval = xfs_dir2_sf_lookup(&args);
  267. else if ((rval = xfs_dir2_isblock(tp, dp, &v)))
  268. return rval;
  269. else if (v)
  270. rval = xfs_dir2_block_lookup(&args);
  271. else if ((rval = xfs_dir2_isleaf(tp, dp, &v)))
  272. return rval;
  273. else if (v)
  274. rval = xfs_dir2_leaf_lookup(&args);
  275. else
  276. rval = xfs_dir2_node_lookup(&args);
  277. if (rval == EEXIST)
  278. rval = 0;
  279. if (!rval) {
  280. *inum = args.inumber;
  281. if (ci_name) {
  282. ci_name->name = args.value;
  283. ci_name->len = args.valuelen;
  284. }
  285. }
  286. return rval;
  287. }
  288. /*
  289. * Remove an entry from a directory.
  290. */
  291. int
  292. xfs_dir_removename(
  293. xfs_trans_t *tp,
  294. xfs_inode_t *dp,
  295. struct xfs_name *name,
  296. xfs_ino_t ino,
  297. xfs_fsblock_t *first, /* bmap's firstblock */
  298. xfs_bmap_free_t *flist, /* bmap's freeblock list */
  299. xfs_extlen_t total) /* bmap's total block count */
  300. {
  301. xfs_da_args_t args;
  302. int rval;
  303. int v; /* type-checking value */
  304. ASSERT(S_ISDIR(dp->i_d.di_mode));
  305. XFS_STATS_INC(xs_dir_remove);
  306. memset(&args, 0, sizeof(xfs_da_args_t));
  307. args.name = name->name;
  308. args.namelen = name->len;
  309. args.hashval = dp->i_mount->m_dirnameops->hashname(name);
  310. args.inumber = ino;
  311. args.dp = dp;
  312. args.firstblock = first;
  313. args.flist = flist;
  314. args.total = total;
  315. args.whichfork = XFS_DATA_FORK;
  316. args.trans = tp;
  317. if (dp->i_d.di_format == XFS_DINODE_FMT_LOCAL)
  318. rval = xfs_dir2_sf_removename(&args);
  319. else if ((rval = xfs_dir2_isblock(tp, dp, &v)))
  320. return rval;
  321. else if (v)
  322. rval = xfs_dir2_block_removename(&args);
  323. else if ((rval = xfs_dir2_isleaf(tp, dp, &v)))
  324. return rval;
  325. else if (v)
  326. rval = xfs_dir2_leaf_removename(&args);
  327. else
  328. rval = xfs_dir2_node_removename(&args);
  329. return rval;
  330. }
  331. /*
  332. * Replace the inode number of a directory entry.
  333. */
  334. int
  335. xfs_dir_replace(
  336. xfs_trans_t *tp,
  337. xfs_inode_t *dp,
  338. struct xfs_name *name, /* name of entry to replace */
  339. xfs_ino_t inum, /* new inode number */
  340. xfs_fsblock_t *first, /* bmap's firstblock */
  341. xfs_bmap_free_t *flist, /* bmap's freeblock list */
  342. xfs_extlen_t total) /* bmap's total block count */
  343. {
  344. xfs_da_args_t args;
  345. int rval;
  346. int v; /* type-checking value */
  347. ASSERT(S_ISDIR(dp->i_d.di_mode));
  348. if ((rval = xfs_dir_ino_validate(tp->t_mountp, inum)))
  349. return rval;
  350. memset(&args, 0, sizeof(xfs_da_args_t));
  351. args.name = name->name;
  352. args.namelen = name->len;
  353. args.hashval = dp->i_mount->m_dirnameops->hashname(name);
  354. args.inumber = inum;
  355. args.dp = dp;
  356. args.firstblock = first;
  357. args.flist = flist;
  358. args.total = total;
  359. args.whichfork = XFS_DATA_FORK;
  360. args.trans = tp;
  361. if (dp->i_d.di_format == XFS_DINODE_FMT_LOCAL)
  362. rval = xfs_dir2_sf_replace(&args);
  363. else if ((rval = xfs_dir2_isblock(tp, dp, &v)))
  364. return rval;
  365. else if (v)
  366. rval = xfs_dir2_block_replace(&args);
  367. else if ((rval = xfs_dir2_isleaf(tp, dp, &v)))
  368. return rval;
  369. else if (v)
  370. rval = xfs_dir2_leaf_replace(&args);
  371. else
  372. rval = xfs_dir2_node_replace(&args);
  373. return rval;
  374. }
  375. /*
  376. * See if this entry can be added to the directory without allocating space.
  377. * First checks that the caller couldn't reserve enough space (resblks = 0).
  378. */
  379. int
  380. xfs_dir_canenter(
  381. xfs_trans_t *tp,
  382. xfs_inode_t *dp,
  383. struct xfs_name *name, /* name of entry to add */
  384. uint resblks)
  385. {
  386. xfs_da_args_t args;
  387. int rval;
  388. int v; /* type-checking value */
  389. if (resblks)
  390. return 0;
  391. ASSERT(S_ISDIR(dp->i_d.di_mode));
  392. memset(&args, 0, sizeof(xfs_da_args_t));
  393. args.name = name->name;
  394. args.namelen = name->len;
  395. args.hashval = dp->i_mount->m_dirnameops->hashname(name);
  396. args.dp = dp;
  397. args.whichfork = XFS_DATA_FORK;
  398. args.trans = tp;
  399. args.op_flags = XFS_DA_OP_JUSTCHECK | XFS_DA_OP_ADDNAME |
  400. XFS_DA_OP_OKNOENT;
  401. if (dp->i_d.di_format == XFS_DINODE_FMT_LOCAL)
  402. rval = xfs_dir2_sf_addname(&args);
  403. else if ((rval = xfs_dir2_isblock(tp, dp, &v)))
  404. return rval;
  405. else if (v)
  406. rval = xfs_dir2_block_addname(&args);
  407. else if ((rval = xfs_dir2_isleaf(tp, dp, &v)))
  408. return rval;
  409. else if (v)
  410. rval = xfs_dir2_leaf_addname(&args);
  411. else
  412. rval = xfs_dir2_node_addname(&args);
  413. return rval;
  414. }
  415. /*
  416. * Utility routines.
  417. */
  418. /*
  419. * Add a block to the directory.
  420. *
  421. * This routine is for data and free blocks, not leaf/node blocks which are
  422. * handled by xfs_da_grow_inode.
  423. */
  424. int
  425. xfs_dir2_grow_inode(
  426. struct xfs_da_args *args,
  427. int space, /* v2 dir's space XFS_DIR2_xxx_SPACE */
  428. xfs_dir2_db_t *dbp) /* out: block number added */
  429. {
  430. struct xfs_inode *dp = args->dp;
  431. struct xfs_mount *mp = dp->i_mount;
  432. xfs_fileoff_t bno; /* directory offset of new block */
  433. int count; /* count of filesystem blocks */
  434. int error;
  435. trace_xfs_dir2_grow_inode(args, space);
  436. /*
  437. * Set lowest possible block in the space requested.
  438. */
  439. bno = XFS_B_TO_FSBT(mp, space * XFS_DIR2_SPACE_SIZE);
  440. count = mp->m_dirblkfsbs;
  441. error = xfs_da_grow_inode_int(args, &bno, count);
  442. if (error)
  443. return error;
  444. *dbp = xfs_dir2_da_to_db(mp, (xfs_dablk_t)bno);
  445. /*
  446. * Update file's size if this is the data space and it grew.
  447. */
  448. if (space == XFS_DIR2_DATA_SPACE) {
  449. xfs_fsize_t size; /* directory file (data) size */
  450. size = XFS_FSB_TO_B(mp, bno + count);
  451. if (size > dp->i_d.di_size) {
  452. dp->i_d.di_size = size;
  453. xfs_trans_log_inode(args->trans, dp, XFS_ILOG_CORE);
  454. }
  455. }
  456. return 0;
  457. }
  458. /*
  459. * See if the directory is a single-block form directory.
  460. */
  461. int
  462. xfs_dir2_isblock(
  463. xfs_trans_t *tp,
  464. xfs_inode_t *dp,
  465. int *vp) /* out: 1 is block, 0 is not block */
  466. {
  467. xfs_fileoff_t last; /* last file offset */
  468. xfs_mount_t *mp;
  469. int rval;
  470. mp = dp->i_mount;
  471. if ((rval = xfs_bmap_last_offset(tp, dp, &last, XFS_DATA_FORK)))
  472. return rval;
  473. rval = XFS_FSB_TO_B(mp, last) == mp->m_dirblksize;
  474. ASSERT(rval == 0 || dp->i_d.di_size == mp->m_dirblksize);
  475. *vp = rval;
  476. return 0;
  477. }
  478. /*
  479. * See if the directory is a single-leaf form directory.
  480. */
  481. int
  482. xfs_dir2_isleaf(
  483. xfs_trans_t *tp,
  484. xfs_inode_t *dp,
  485. int *vp) /* out: 1 is leaf, 0 is not leaf */
  486. {
  487. xfs_fileoff_t last; /* last file offset */
  488. xfs_mount_t *mp;
  489. int rval;
  490. mp = dp->i_mount;
  491. if ((rval = xfs_bmap_last_offset(tp, dp, &last, XFS_DATA_FORK)))
  492. return rval;
  493. *vp = last == mp->m_dirleafblk + (1 << mp->m_sb.sb_dirblklog);
  494. return 0;
  495. }
  496. /*
  497. * Remove the given block from the directory.
  498. * This routine is used for data and free blocks, leaf/node are done
  499. * by xfs_da_shrink_inode.
  500. */
  501. int
  502. xfs_dir2_shrink_inode(
  503. xfs_da_args_t *args,
  504. xfs_dir2_db_t db,
  505. struct xfs_buf *bp)
  506. {
  507. xfs_fileoff_t bno; /* directory file offset */
  508. xfs_dablk_t da; /* directory file offset */
  509. int done; /* bunmap is finished */
  510. xfs_inode_t *dp;
  511. int error;
  512. xfs_mount_t *mp;
  513. xfs_trans_t *tp;
  514. trace_xfs_dir2_shrink_inode(args, db);
  515. dp = args->dp;
  516. mp = dp->i_mount;
  517. tp = args->trans;
  518. da = xfs_dir2_db_to_da(mp, db);
  519. /*
  520. * Unmap the fsblock(s).
  521. */
  522. if ((error = xfs_bunmapi(tp, dp, da, mp->m_dirblkfsbs,
  523. XFS_BMAPI_METADATA, 0, args->firstblock, args->flist,
  524. &done))) {
  525. /*
  526. * ENOSPC actually can happen if we're in a removename with
  527. * no space reservation, and the resulting block removal
  528. * would cause a bmap btree split or conversion from extents
  529. * to btree. This can only happen for un-fragmented
  530. * directory blocks, since you need to be punching out
  531. * the middle of an extent.
  532. * In this case we need to leave the block in the file,
  533. * and not binval it.
  534. * So the block has to be in a consistent empty state
  535. * and appropriately logged.
  536. * We don't free up the buffer, the caller can tell it
  537. * hasn't happened since it got an error back.
  538. */
  539. return error;
  540. }
  541. ASSERT(done);
  542. /*
  543. * Invalidate the buffer from the transaction.
  544. */
  545. xfs_trans_binval(tp, bp);
  546. /*
  547. * If it's not a data block, we're done.
  548. */
  549. if (db >= XFS_DIR2_LEAF_FIRSTDB(mp))
  550. return 0;
  551. /*
  552. * If the block isn't the last one in the directory, we're done.
  553. */
  554. if (dp->i_d.di_size > xfs_dir2_db_off_to_byte(mp, db + 1, 0))
  555. return 0;
  556. bno = da;
  557. if ((error = xfs_bmap_last_before(tp, dp, &bno, XFS_DATA_FORK))) {
  558. /*
  559. * This can't really happen unless there's kernel corruption.
  560. */
  561. return error;
  562. }
  563. if (db == mp->m_dirdatablk)
  564. ASSERT(bno == 0);
  565. else
  566. ASSERT(bno > 0);
  567. /*
  568. * Set the size to the new last block.
  569. */
  570. dp->i_d.di_size = XFS_FSB_TO_B(mp, bno);
  571. xfs_trans_log_inode(tp, dp, XFS_ILOG_CORE);
  572. return 0;
  573. }