xfs_dir2.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640
  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, XFS_DIR3_FT_DIR };
  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. int nodehdr_size;
  83. ASSERT(xfs_sb_version_hasdirv2(&mp->m_sb));
  84. ASSERT((1 << (mp->m_sb.sb_blocklog + mp->m_sb.sb_dirblklog)) <=
  85. XFS_MAX_BLOCKSIZE);
  86. mp->m_dirblksize = 1 << (mp->m_sb.sb_blocklog + mp->m_sb.sb_dirblklog);
  87. mp->m_dirblkfsbs = 1 << mp->m_sb.sb_dirblklog;
  88. mp->m_dirdatablk = xfs_dir2_db_to_da(mp, XFS_DIR2_DATA_FIRSTDB(mp));
  89. mp->m_dirleafblk = xfs_dir2_db_to_da(mp, XFS_DIR2_LEAF_FIRSTDB(mp));
  90. mp->m_dirfreeblk = xfs_dir2_db_to_da(mp, XFS_DIR2_FREE_FIRSTDB(mp));
  91. nodehdr_size = __xfs_da3_node_hdr_size(xfs_sb_version_hascrc(&mp->m_sb));
  92. mp->m_attr_node_ents = (mp->m_sb.sb_blocksize - nodehdr_size) /
  93. (uint)sizeof(xfs_da_node_entry_t);
  94. mp->m_dir_node_ents = (mp->m_dirblksize - nodehdr_size) /
  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.filetype = name->type;
  193. args.hashval = dp->i_mount->m_dirnameops->hashname(name);
  194. args.inumber = inum;
  195. args.dp = dp;
  196. args.firstblock = first;
  197. args.flist = flist;
  198. args.total = total;
  199. args.whichfork = XFS_DATA_FORK;
  200. args.trans = tp;
  201. args.op_flags = XFS_DA_OP_ADDNAME | XFS_DA_OP_OKNOENT;
  202. if (dp->i_d.di_format == XFS_DINODE_FMT_LOCAL)
  203. rval = xfs_dir2_sf_addname(&args);
  204. else if ((rval = xfs_dir2_isblock(tp, dp, &v)))
  205. return rval;
  206. else if (v)
  207. rval = xfs_dir2_block_addname(&args);
  208. else if ((rval = xfs_dir2_isleaf(tp, dp, &v)))
  209. return rval;
  210. else if (v)
  211. rval = xfs_dir2_leaf_addname(&args);
  212. else
  213. rval = xfs_dir2_node_addname(&args);
  214. return rval;
  215. }
  216. /*
  217. * If doing a CI lookup and case-insensitive match, dup actual name into
  218. * args.value. Return EEXIST for success (ie. name found) or an error.
  219. */
  220. int
  221. xfs_dir_cilookup_result(
  222. struct xfs_da_args *args,
  223. const unsigned char *name,
  224. int len)
  225. {
  226. if (args->cmpresult == XFS_CMP_DIFFERENT)
  227. return ENOENT;
  228. if (args->cmpresult != XFS_CMP_CASE ||
  229. !(args->op_flags & XFS_DA_OP_CILOOKUP))
  230. return EEXIST;
  231. args->value = kmem_alloc(len, KM_NOFS | KM_MAYFAIL);
  232. if (!args->value)
  233. return ENOMEM;
  234. memcpy(args->value, name, len);
  235. args->valuelen = len;
  236. return EEXIST;
  237. }
  238. /*
  239. * Lookup a name in a directory, give back the inode number.
  240. * If ci_name is not NULL, returns the actual name in ci_name if it differs
  241. * to name, or ci_name->name is set to NULL for an exact match.
  242. */
  243. int
  244. xfs_dir_lookup(
  245. xfs_trans_t *tp,
  246. xfs_inode_t *dp,
  247. struct xfs_name *name,
  248. xfs_ino_t *inum, /* out: inode number */
  249. struct xfs_name *ci_name) /* out: actual name if CI match */
  250. {
  251. xfs_da_args_t args;
  252. int rval;
  253. int v; /* type-checking value */
  254. ASSERT(S_ISDIR(dp->i_d.di_mode));
  255. XFS_STATS_INC(xs_dir_lookup);
  256. memset(&args, 0, sizeof(xfs_da_args_t));
  257. args.name = name->name;
  258. args.namelen = name->len;
  259. args.filetype = name->type;
  260. args.hashval = dp->i_mount->m_dirnameops->hashname(name);
  261. args.dp = dp;
  262. args.whichfork = XFS_DATA_FORK;
  263. args.trans = tp;
  264. args.op_flags = XFS_DA_OP_OKNOENT;
  265. if (ci_name)
  266. args.op_flags |= XFS_DA_OP_CILOOKUP;
  267. if (dp->i_d.di_format == XFS_DINODE_FMT_LOCAL)
  268. rval = xfs_dir2_sf_lookup(&args);
  269. else if ((rval = xfs_dir2_isblock(tp, dp, &v)))
  270. return rval;
  271. else if (v)
  272. rval = xfs_dir2_block_lookup(&args);
  273. else if ((rval = xfs_dir2_isleaf(tp, dp, &v)))
  274. return rval;
  275. else if (v)
  276. rval = xfs_dir2_leaf_lookup(&args);
  277. else
  278. rval = xfs_dir2_node_lookup(&args);
  279. if (rval == EEXIST)
  280. rval = 0;
  281. if (!rval) {
  282. *inum = args.inumber;
  283. if (ci_name) {
  284. ci_name->name = args.value;
  285. ci_name->len = args.valuelen;
  286. }
  287. }
  288. return rval;
  289. }
  290. /*
  291. * Remove an entry from a directory.
  292. */
  293. int
  294. xfs_dir_removename(
  295. xfs_trans_t *tp,
  296. xfs_inode_t *dp,
  297. struct xfs_name *name,
  298. xfs_ino_t ino,
  299. xfs_fsblock_t *first, /* bmap's firstblock */
  300. xfs_bmap_free_t *flist, /* bmap's freeblock list */
  301. xfs_extlen_t total) /* bmap's total block count */
  302. {
  303. xfs_da_args_t args;
  304. int rval;
  305. int v; /* type-checking value */
  306. ASSERT(S_ISDIR(dp->i_d.di_mode));
  307. XFS_STATS_INC(xs_dir_remove);
  308. memset(&args, 0, sizeof(xfs_da_args_t));
  309. args.name = name->name;
  310. args.namelen = name->len;
  311. args.filetype = name->type;
  312. args.hashval = dp->i_mount->m_dirnameops->hashname(name);
  313. args.inumber = ino;
  314. args.dp = dp;
  315. args.firstblock = first;
  316. args.flist = flist;
  317. args.total = total;
  318. args.whichfork = XFS_DATA_FORK;
  319. args.trans = tp;
  320. if (dp->i_d.di_format == XFS_DINODE_FMT_LOCAL)
  321. rval = xfs_dir2_sf_removename(&args);
  322. else if ((rval = xfs_dir2_isblock(tp, dp, &v)))
  323. return rval;
  324. else if (v)
  325. rval = xfs_dir2_block_removename(&args);
  326. else if ((rval = xfs_dir2_isleaf(tp, dp, &v)))
  327. return rval;
  328. else if (v)
  329. rval = xfs_dir2_leaf_removename(&args);
  330. else
  331. rval = xfs_dir2_node_removename(&args);
  332. return rval;
  333. }
  334. /*
  335. * Replace the inode number of a directory entry.
  336. */
  337. int
  338. xfs_dir_replace(
  339. xfs_trans_t *tp,
  340. xfs_inode_t *dp,
  341. struct xfs_name *name, /* name of entry to replace */
  342. xfs_ino_t inum, /* new inode number */
  343. xfs_fsblock_t *first, /* bmap's firstblock */
  344. xfs_bmap_free_t *flist, /* bmap's freeblock list */
  345. xfs_extlen_t total) /* bmap's total block count */
  346. {
  347. xfs_da_args_t args;
  348. int rval;
  349. int v; /* type-checking value */
  350. ASSERT(S_ISDIR(dp->i_d.di_mode));
  351. if ((rval = xfs_dir_ino_validate(tp->t_mountp, inum)))
  352. return rval;
  353. memset(&args, 0, sizeof(xfs_da_args_t));
  354. args.name = name->name;
  355. args.namelen = name->len;
  356. args.filetype = name->type;
  357. args.hashval = dp->i_mount->m_dirnameops->hashname(name);
  358. args.inumber = inum;
  359. args.dp = dp;
  360. args.firstblock = first;
  361. args.flist = flist;
  362. args.total = total;
  363. args.whichfork = XFS_DATA_FORK;
  364. args.trans = tp;
  365. if (dp->i_d.di_format == XFS_DINODE_FMT_LOCAL)
  366. rval = xfs_dir2_sf_replace(&args);
  367. else if ((rval = xfs_dir2_isblock(tp, dp, &v)))
  368. return rval;
  369. else if (v)
  370. rval = xfs_dir2_block_replace(&args);
  371. else if ((rval = xfs_dir2_isleaf(tp, dp, &v)))
  372. return rval;
  373. else if (v)
  374. rval = xfs_dir2_leaf_replace(&args);
  375. else
  376. rval = xfs_dir2_node_replace(&args);
  377. return rval;
  378. }
  379. /*
  380. * See if this entry can be added to the directory without allocating space.
  381. * First checks that the caller couldn't reserve enough space (resblks = 0).
  382. */
  383. int
  384. xfs_dir_canenter(
  385. xfs_trans_t *tp,
  386. xfs_inode_t *dp,
  387. struct xfs_name *name, /* name of entry to add */
  388. uint resblks)
  389. {
  390. xfs_da_args_t args;
  391. int rval;
  392. int v; /* type-checking value */
  393. if (resblks)
  394. return 0;
  395. ASSERT(S_ISDIR(dp->i_d.di_mode));
  396. memset(&args, 0, sizeof(xfs_da_args_t));
  397. args.name = name->name;
  398. args.namelen = name->len;
  399. args.filetype = name->type;
  400. args.hashval = dp->i_mount->m_dirnameops->hashname(name);
  401. args.dp = dp;
  402. args.whichfork = XFS_DATA_FORK;
  403. args.trans = tp;
  404. args.op_flags = XFS_DA_OP_JUSTCHECK | XFS_DA_OP_ADDNAME |
  405. XFS_DA_OP_OKNOENT;
  406. if (dp->i_d.di_format == XFS_DINODE_FMT_LOCAL)
  407. rval = xfs_dir2_sf_addname(&args);
  408. else if ((rval = xfs_dir2_isblock(tp, dp, &v)))
  409. return rval;
  410. else if (v)
  411. rval = xfs_dir2_block_addname(&args);
  412. else if ((rval = xfs_dir2_isleaf(tp, dp, &v)))
  413. return rval;
  414. else if (v)
  415. rval = xfs_dir2_leaf_addname(&args);
  416. else
  417. rval = xfs_dir2_node_addname(&args);
  418. return rval;
  419. }
  420. /*
  421. * Utility routines.
  422. */
  423. /*
  424. * Add a block to the directory.
  425. *
  426. * This routine is for data and free blocks, not leaf/node blocks which are
  427. * handled by xfs_da_grow_inode.
  428. */
  429. int
  430. xfs_dir2_grow_inode(
  431. struct xfs_da_args *args,
  432. int space, /* v2 dir's space XFS_DIR2_xxx_SPACE */
  433. xfs_dir2_db_t *dbp) /* out: block number added */
  434. {
  435. struct xfs_inode *dp = args->dp;
  436. struct xfs_mount *mp = dp->i_mount;
  437. xfs_fileoff_t bno; /* directory offset of new block */
  438. int count; /* count of filesystem blocks */
  439. int error;
  440. trace_xfs_dir2_grow_inode(args, space);
  441. /*
  442. * Set lowest possible block in the space requested.
  443. */
  444. bno = XFS_B_TO_FSBT(mp, space * XFS_DIR2_SPACE_SIZE);
  445. count = mp->m_dirblkfsbs;
  446. error = xfs_da_grow_inode_int(args, &bno, count);
  447. if (error)
  448. return error;
  449. *dbp = xfs_dir2_da_to_db(mp, (xfs_dablk_t)bno);
  450. /*
  451. * Update file's size if this is the data space and it grew.
  452. */
  453. if (space == XFS_DIR2_DATA_SPACE) {
  454. xfs_fsize_t size; /* directory file (data) size */
  455. size = XFS_FSB_TO_B(mp, bno + count);
  456. if (size > dp->i_d.di_size) {
  457. dp->i_d.di_size = size;
  458. xfs_trans_log_inode(args->trans, dp, XFS_ILOG_CORE);
  459. }
  460. }
  461. return 0;
  462. }
  463. /*
  464. * See if the directory is a single-block form directory.
  465. */
  466. int
  467. xfs_dir2_isblock(
  468. xfs_trans_t *tp,
  469. xfs_inode_t *dp,
  470. int *vp) /* out: 1 is block, 0 is not block */
  471. {
  472. xfs_fileoff_t last; /* last file offset */
  473. xfs_mount_t *mp;
  474. int rval;
  475. mp = dp->i_mount;
  476. if ((rval = xfs_bmap_last_offset(tp, dp, &last, XFS_DATA_FORK)))
  477. return rval;
  478. rval = XFS_FSB_TO_B(mp, last) == mp->m_dirblksize;
  479. ASSERT(rval == 0 || dp->i_d.di_size == mp->m_dirblksize);
  480. *vp = rval;
  481. return 0;
  482. }
  483. /*
  484. * See if the directory is a single-leaf form directory.
  485. */
  486. int
  487. xfs_dir2_isleaf(
  488. xfs_trans_t *tp,
  489. xfs_inode_t *dp,
  490. int *vp) /* out: 1 is leaf, 0 is not leaf */
  491. {
  492. xfs_fileoff_t last; /* last file offset */
  493. xfs_mount_t *mp;
  494. int rval;
  495. mp = dp->i_mount;
  496. if ((rval = xfs_bmap_last_offset(tp, dp, &last, XFS_DATA_FORK)))
  497. return rval;
  498. *vp = last == mp->m_dirleafblk + (1 << mp->m_sb.sb_dirblklog);
  499. return 0;
  500. }
  501. /*
  502. * Remove the given block from the directory.
  503. * This routine is used for data and free blocks, leaf/node are done
  504. * by xfs_da_shrink_inode.
  505. */
  506. int
  507. xfs_dir2_shrink_inode(
  508. xfs_da_args_t *args,
  509. xfs_dir2_db_t db,
  510. struct xfs_buf *bp)
  511. {
  512. xfs_fileoff_t bno; /* directory file offset */
  513. xfs_dablk_t da; /* directory file offset */
  514. int done; /* bunmap is finished */
  515. xfs_inode_t *dp;
  516. int error;
  517. xfs_mount_t *mp;
  518. xfs_trans_t *tp;
  519. trace_xfs_dir2_shrink_inode(args, db);
  520. dp = args->dp;
  521. mp = dp->i_mount;
  522. tp = args->trans;
  523. da = xfs_dir2_db_to_da(mp, db);
  524. /*
  525. * Unmap the fsblock(s).
  526. */
  527. if ((error = xfs_bunmapi(tp, dp, da, mp->m_dirblkfsbs,
  528. XFS_BMAPI_METADATA, 0, args->firstblock, args->flist,
  529. &done))) {
  530. /*
  531. * ENOSPC actually can happen if we're in a removename with
  532. * no space reservation, and the resulting block removal
  533. * would cause a bmap btree split or conversion from extents
  534. * to btree. This can only happen for un-fragmented
  535. * directory blocks, since you need to be punching out
  536. * the middle of an extent.
  537. * In this case we need to leave the block in the file,
  538. * and not binval it.
  539. * So the block has to be in a consistent empty state
  540. * and appropriately logged.
  541. * We don't free up the buffer, the caller can tell it
  542. * hasn't happened since it got an error back.
  543. */
  544. return error;
  545. }
  546. ASSERT(done);
  547. /*
  548. * Invalidate the buffer from the transaction.
  549. */
  550. xfs_trans_binval(tp, bp);
  551. /*
  552. * If it's not a data block, we're done.
  553. */
  554. if (db >= XFS_DIR2_LEAF_FIRSTDB(mp))
  555. return 0;
  556. /*
  557. * If the block isn't the last one in the directory, we're done.
  558. */
  559. if (dp->i_d.di_size > xfs_dir2_db_off_to_byte(mp, db + 1, 0))
  560. return 0;
  561. bno = da;
  562. if ((error = xfs_bmap_last_before(tp, dp, &bno, XFS_DATA_FORK))) {
  563. /*
  564. * This can't really happen unless there's kernel corruption.
  565. */
  566. return error;
  567. }
  568. if (db == mp->m_dirdatablk)
  569. ASSERT(bno == 0);
  570. else
  571. ASSERT(bno > 0);
  572. /*
  573. * Set the size to the new last block.
  574. */
  575. dp->i_d.di_size = XFS_FSB_TO_B(mp, bno);
  576. xfs_trans_log_inode(tp, dp, XFS_ILOG_CORE);
  577. return 0;
  578. }