directory.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542
  1. // SPDX-License-Identifier: GPL-2.0-only
  2. /*
  3. * directory.c
  4. *
  5. * PURPOSE
  6. * Directory related functions
  7. *
  8. */
  9. #include "udfdecl.h"
  10. #include "udf_i.h"
  11. #include <linux/fs.h>
  12. #include <linux/string.h>
  13. #include <linux/bio.h>
  14. #include <linux/crc-itu-t.h>
  15. #include <linux/iversion.h>
  16. static int udf_verify_fi(struct udf_fileident_iter *iter)
  17. {
  18. unsigned int len;
  19. if (iter->fi.descTag.tagIdent != cpu_to_le16(TAG_IDENT_FID)) {
  20. udf_err(iter->dir->i_sb,
  21. "directory (ino %lu) has entry at pos %llu with incorrect tag %x\n",
  22. iter->dir->i_ino, (unsigned long long)iter->pos,
  23. le16_to_cpu(iter->fi.descTag.tagIdent));
  24. return -EFSCORRUPTED;
  25. }
  26. len = udf_dir_entry_len(&iter->fi);
  27. if (le16_to_cpu(iter->fi.lengthOfImpUse) & 3) {
  28. udf_err(iter->dir->i_sb,
  29. "directory (ino %lu) has entry at pos %llu with unaligned length of impUse field\n",
  30. iter->dir->i_ino, (unsigned long long)iter->pos);
  31. return -EFSCORRUPTED;
  32. }
  33. /*
  34. * This is in fact allowed by the spec due to long impUse field but
  35. * we don't support it. If there is real media with this large impUse
  36. * field, support can be added.
  37. */
  38. if (len > 1 << iter->dir->i_blkbits) {
  39. udf_err(iter->dir->i_sb,
  40. "directory (ino %lu) has too big (%u) entry at pos %llu\n",
  41. iter->dir->i_ino, len, (unsigned long long)iter->pos);
  42. return -EFSCORRUPTED;
  43. }
  44. if (iter->pos + len > iter->dir->i_size) {
  45. udf_err(iter->dir->i_sb,
  46. "directory (ino %lu) has entry past directory size at pos %llu\n",
  47. iter->dir->i_ino, (unsigned long long)iter->pos);
  48. return -EFSCORRUPTED;
  49. }
  50. if (udf_dir_entry_len(&iter->fi) !=
  51. sizeof(struct tag) + le16_to_cpu(iter->fi.descTag.descCRCLength)) {
  52. udf_err(iter->dir->i_sb,
  53. "directory (ino %lu) has entry where CRC length (%u) does not match entry length (%u)\n",
  54. iter->dir->i_ino,
  55. (unsigned)le16_to_cpu(iter->fi.descTag.descCRCLength),
  56. (unsigned)(udf_dir_entry_len(&iter->fi) -
  57. sizeof(struct tag)));
  58. return -EFSCORRUPTED;
  59. }
  60. return 0;
  61. }
  62. static int udf_copy_fi(struct udf_fileident_iter *iter)
  63. {
  64. struct udf_inode_info *iinfo = UDF_I(iter->dir);
  65. u32 blksize = 1 << iter->dir->i_blkbits;
  66. u32 off, len, nameoff;
  67. int err;
  68. /* Skip copying when we are at EOF */
  69. if (iter->pos >= iter->dir->i_size) {
  70. iter->name = NULL;
  71. return 0;
  72. }
  73. if (iter->dir->i_size < iter->pos + sizeof(struct fileIdentDesc)) {
  74. udf_err(iter->dir->i_sb,
  75. "directory (ino %lu) has entry straddling EOF\n",
  76. iter->dir->i_ino);
  77. return -EFSCORRUPTED;
  78. }
  79. if (iinfo->i_alloc_type == ICBTAG_FLAG_AD_IN_ICB) {
  80. memcpy(&iter->fi, iinfo->i_data + iinfo->i_lenEAttr + iter->pos,
  81. sizeof(struct fileIdentDesc));
  82. err = udf_verify_fi(iter);
  83. if (err < 0)
  84. return err;
  85. iter->name = iinfo->i_data + iinfo->i_lenEAttr + iter->pos +
  86. sizeof(struct fileIdentDesc) +
  87. le16_to_cpu(iter->fi.lengthOfImpUse);
  88. return 0;
  89. }
  90. off = iter->pos & (blksize - 1);
  91. len = min_t(u32, sizeof(struct fileIdentDesc), blksize - off);
  92. memcpy(&iter->fi, iter->bh[0]->b_data + off, len);
  93. if (len < sizeof(struct fileIdentDesc))
  94. memcpy((char *)(&iter->fi) + len, iter->bh[1]->b_data,
  95. sizeof(struct fileIdentDesc) - len);
  96. err = udf_verify_fi(iter);
  97. if (err < 0)
  98. return err;
  99. /* Handle directory entry name */
  100. nameoff = off + sizeof(struct fileIdentDesc) +
  101. le16_to_cpu(iter->fi.lengthOfImpUse);
  102. if (off + udf_dir_entry_len(&iter->fi) <= blksize) {
  103. iter->name = iter->bh[0]->b_data + nameoff;
  104. } else if (nameoff >= blksize) {
  105. iter->name = iter->bh[1]->b_data + (nameoff - blksize);
  106. } else {
  107. iter->name = iter->namebuf;
  108. len = blksize - nameoff;
  109. memcpy(iter->name, iter->bh[0]->b_data + nameoff, len);
  110. memcpy(iter->name + len, iter->bh[1]->b_data,
  111. iter->fi.lengthFileIdent - len);
  112. }
  113. return 0;
  114. }
  115. /* Readahead 8k once we are at 8k boundary */
  116. static void udf_readahead_dir(struct udf_fileident_iter *iter)
  117. {
  118. unsigned int ralen = 16 >> (iter->dir->i_blkbits - 9);
  119. struct buffer_head *tmp, *bha[16];
  120. int i, num;
  121. udf_pblk_t blk;
  122. if (iter->loffset & (ralen - 1))
  123. return;
  124. if (iter->loffset + ralen > (iter->elen >> iter->dir->i_blkbits))
  125. ralen = (iter->elen >> iter->dir->i_blkbits) - iter->loffset;
  126. num = 0;
  127. for (i = 0; i < ralen; i++) {
  128. blk = udf_get_lb_pblock(iter->dir->i_sb, &iter->eloc,
  129. iter->loffset + i);
  130. tmp = sb_getblk(iter->dir->i_sb, blk);
  131. if (tmp && !buffer_uptodate(tmp) && !buffer_locked(tmp))
  132. bha[num++] = tmp;
  133. else
  134. brelse(tmp);
  135. }
  136. if (num) {
  137. bh_readahead_batch(num, bha, REQ_RAHEAD);
  138. for (i = 0; i < num; i++)
  139. brelse(bha[i]);
  140. }
  141. }
  142. static struct buffer_head *udf_fiiter_bread_blk(struct udf_fileident_iter *iter)
  143. {
  144. udf_pblk_t blk;
  145. udf_readahead_dir(iter);
  146. blk = udf_get_lb_pblock(iter->dir->i_sb, &iter->eloc, iter->loffset);
  147. return sb_bread(iter->dir->i_sb, blk);
  148. }
  149. /*
  150. * Updates loffset to point to next directory block; eloc, elen & epos are
  151. * updated if we need to traverse to the next extent as well.
  152. */
  153. static int udf_fiiter_advance_blk(struct udf_fileident_iter *iter)
  154. {
  155. int8_t etype = -1;
  156. int err = 0;
  157. iter->loffset++;
  158. if (iter->loffset < DIV_ROUND_UP(iter->elen, 1<<iter->dir->i_blkbits))
  159. return 0;
  160. iter->loffset = 0;
  161. err = udf_next_aext(iter->dir, &iter->epos, &iter->eloc,
  162. &iter->elen, &etype, 1);
  163. if (err < 0)
  164. return err;
  165. else if (err == 0 || etype != (EXT_RECORDED_ALLOCATED >> 30)) {
  166. if (iter->pos == iter->dir->i_size) {
  167. iter->elen = 0;
  168. return 0;
  169. }
  170. udf_err(iter->dir->i_sb,
  171. "extent after position %llu not allocated in directory (ino %lu)\n",
  172. (unsigned long long)iter->pos, iter->dir->i_ino);
  173. return -EFSCORRUPTED;
  174. }
  175. return 0;
  176. }
  177. static int udf_fiiter_load_bhs(struct udf_fileident_iter *iter)
  178. {
  179. int blksize = 1 << iter->dir->i_blkbits;
  180. int off = iter->pos & (blksize - 1);
  181. int err;
  182. struct fileIdentDesc *fi;
  183. /* Is there any further extent we can map from? */
  184. if (!iter->bh[0] && iter->elen) {
  185. iter->bh[0] = udf_fiiter_bread_blk(iter);
  186. if (!iter->bh[0]) {
  187. err = -ENOMEM;
  188. goto out_brelse;
  189. }
  190. if (!buffer_uptodate(iter->bh[0])) {
  191. err = -EIO;
  192. goto out_brelse;
  193. }
  194. }
  195. /* There's no next block so we are done */
  196. if (iter->pos >= iter->dir->i_size)
  197. return 0;
  198. /* Need to fetch next block as well? */
  199. if (off + sizeof(struct fileIdentDesc) > blksize)
  200. goto fetch_next;
  201. fi = (struct fileIdentDesc *)(iter->bh[0]->b_data + off);
  202. /* Need to fetch next block to get name? */
  203. if (off + udf_dir_entry_len(fi) > blksize) {
  204. fetch_next:
  205. err = udf_fiiter_advance_blk(iter);
  206. if (err)
  207. goto out_brelse;
  208. iter->bh[1] = udf_fiiter_bread_blk(iter);
  209. if (!iter->bh[1]) {
  210. err = -ENOMEM;
  211. goto out_brelse;
  212. }
  213. if (!buffer_uptodate(iter->bh[1])) {
  214. err = -EIO;
  215. goto out_brelse;
  216. }
  217. }
  218. return 0;
  219. out_brelse:
  220. brelse(iter->bh[0]);
  221. brelse(iter->bh[1]);
  222. iter->bh[0] = iter->bh[1] = NULL;
  223. return err;
  224. }
  225. int udf_fiiter_init(struct udf_fileident_iter *iter, struct inode *dir,
  226. loff_t pos)
  227. {
  228. struct udf_inode_info *iinfo = UDF_I(dir);
  229. int err = 0;
  230. int8_t etype;
  231. iter->dir = dir;
  232. iter->bh[0] = iter->bh[1] = NULL;
  233. iter->pos = pos;
  234. iter->elen = 0;
  235. iter->epos.bh = NULL;
  236. iter->name = NULL;
  237. /*
  238. * When directory is verified, we don't expect directory iteration to
  239. * fail and it can be difficult to undo without corrupting filesystem.
  240. * So just do not allow memory allocation failures here.
  241. */
  242. iter->namebuf = kmalloc(UDF_NAME_LEN_CS0, GFP_KERNEL | __GFP_NOFAIL);
  243. if (iinfo->i_alloc_type == ICBTAG_FLAG_AD_IN_ICB) {
  244. err = udf_copy_fi(iter);
  245. goto out;
  246. }
  247. err = inode_bmap(dir, iter->pos >> dir->i_blkbits, &iter->epos,
  248. &iter->eloc, &iter->elen, &iter->loffset, &etype);
  249. if (err <= 0 || etype != (EXT_RECORDED_ALLOCATED >> 30)) {
  250. if (pos == dir->i_size)
  251. return 0;
  252. udf_err(dir->i_sb,
  253. "position %llu not allocated in directory (ino %lu)\n",
  254. (unsigned long long)pos, dir->i_ino);
  255. err = -EFSCORRUPTED;
  256. goto out;
  257. }
  258. err = udf_fiiter_load_bhs(iter);
  259. if (err < 0)
  260. goto out;
  261. err = udf_copy_fi(iter);
  262. out:
  263. if (err < 0)
  264. udf_fiiter_release(iter);
  265. return err;
  266. }
  267. int udf_fiiter_advance(struct udf_fileident_iter *iter)
  268. {
  269. unsigned int oldoff, len;
  270. int blksize = 1 << iter->dir->i_blkbits;
  271. int err;
  272. oldoff = iter->pos & (blksize - 1);
  273. len = udf_dir_entry_len(&iter->fi);
  274. iter->pos += len;
  275. if (UDF_I(iter->dir)->i_alloc_type != ICBTAG_FLAG_AD_IN_ICB) {
  276. if (oldoff + len >= blksize) {
  277. brelse(iter->bh[0]);
  278. iter->bh[0] = NULL;
  279. /* Next block already loaded? */
  280. if (iter->bh[1]) {
  281. iter->bh[0] = iter->bh[1];
  282. iter->bh[1] = NULL;
  283. } else {
  284. err = udf_fiiter_advance_blk(iter);
  285. if (err < 0)
  286. return err;
  287. }
  288. }
  289. err = udf_fiiter_load_bhs(iter);
  290. if (err < 0)
  291. return err;
  292. }
  293. return udf_copy_fi(iter);
  294. }
  295. void udf_fiiter_release(struct udf_fileident_iter *iter)
  296. {
  297. iter->dir = NULL;
  298. brelse(iter->bh[0]);
  299. brelse(iter->bh[1]);
  300. iter->bh[0] = iter->bh[1] = NULL;
  301. kfree(iter->namebuf);
  302. iter->namebuf = NULL;
  303. }
  304. static void udf_copy_to_bufs(void *buf1, int len1, void *buf2, int len2,
  305. int off, void *src, int len)
  306. {
  307. int copy;
  308. if (off >= len1) {
  309. off -= len1;
  310. } else {
  311. copy = min(off + len, len1) - off;
  312. memcpy(buf1 + off, src, copy);
  313. src += copy;
  314. len -= copy;
  315. off = 0;
  316. }
  317. if (len > 0) {
  318. if (WARN_ON_ONCE(off + len > len2 || !buf2))
  319. return;
  320. memcpy(buf2 + off, src, len);
  321. }
  322. }
  323. static uint16_t udf_crc_fi_bufs(void *buf1, int len1, void *buf2, int len2,
  324. int off, int len)
  325. {
  326. int copy;
  327. uint16_t crc = 0;
  328. if (off >= len1) {
  329. off -= len1;
  330. } else {
  331. copy = min(off + len, len1) - off;
  332. crc = crc_itu_t(crc, buf1 + off, copy);
  333. len -= copy;
  334. off = 0;
  335. }
  336. if (len > 0) {
  337. if (WARN_ON_ONCE(off + len > len2 || !buf2))
  338. return 0;
  339. crc = crc_itu_t(crc, buf2 + off, len);
  340. }
  341. return crc;
  342. }
  343. static void udf_copy_fi_to_bufs(char *buf1, int len1, char *buf2, int len2,
  344. int off, struct fileIdentDesc *fi,
  345. uint8_t *impuse, uint8_t *name)
  346. {
  347. uint16_t crc;
  348. int fioff = off;
  349. int crcoff = off + sizeof(struct tag);
  350. unsigned int crclen = udf_dir_entry_len(fi) - sizeof(struct tag);
  351. char zeros[UDF_NAME_PAD] = {};
  352. int endoff = off + udf_dir_entry_len(fi);
  353. udf_copy_to_bufs(buf1, len1, buf2, len2, off, fi,
  354. sizeof(struct fileIdentDesc));
  355. off += sizeof(struct fileIdentDesc);
  356. if (impuse)
  357. udf_copy_to_bufs(buf1, len1, buf2, len2, off, impuse,
  358. le16_to_cpu(fi->lengthOfImpUse));
  359. off += le16_to_cpu(fi->lengthOfImpUse);
  360. if (name) {
  361. udf_copy_to_bufs(buf1, len1, buf2, len2, off, name,
  362. fi->lengthFileIdent);
  363. off += fi->lengthFileIdent;
  364. udf_copy_to_bufs(buf1, len1, buf2, len2, off, zeros,
  365. endoff - off);
  366. }
  367. crc = udf_crc_fi_bufs(buf1, len1, buf2, len2, crcoff, crclen);
  368. fi->descTag.descCRC = cpu_to_le16(crc);
  369. fi->descTag.descCRCLength = cpu_to_le16(crclen);
  370. fi->descTag.tagChecksum = udf_tag_checksum(&fi->descTag);
  371. udf_copy_to_bufs(buf1, len1, buf2, len2, fioff, fi, sizeof(struct tag));
  372. }
  373. void udf_fiiter_write_fi(struct udf_fileident_iter *iter, uint8_t *impuse)
  374. {
  375. struct udf_inode_info *iinfo = UDF_I(iter->dir);
  376. void *buf1, *buf2 = NULL;
  377. int len1, len2 = 0, off;
  378. int blksize = 1 << iter->dir->i_blkbits;
  379. off = iter->pos & (blksize - 1);
  380. if (iinfo->i_alloc_type == ICBTAG_FLAG_AD_IN_ICB) {
  381. buf1 = iinfo->i_data + iinfo->i_lenEAttr;
  382. len1 = iter->dir->i_size;
  383. } else {
  384. buf1 = iter->bh[0]->b_data;
  385. len1 = blksize;
  386. if (iter->bh[1]) {
  387. buf2 = iter->bh[1]->b_data;
  388. len2 = blksize;
  389. }
  390. }
  391. udf_copy_fi_to_bufs(buf1, len1, buf2, len2, off, &iter->fi, impuse,
  392. iter->name == iter->namebuf ? iter->name : NULL);
  393. if (iinfo->i_alloc_type == ICBTAG_FLAG_AD_IN_ICB) {
  394. mark_inode_dirty(iter->dir);
  395. } else {
  396. mark_buffer_dirty_inode(iter->bh[0], iter->dir);
  397. if (iter->bh[1])
  398. mark_buffer_dirty_inode(iter->bh[1], iter->dir);
  399. }
  400. inode_inc_iversion(iter->dir);
  401. }
  402. void udf_fiiter_update_elen(struct udf_fileident_iter *iter, uint32_t new_elen)
  403. {
  404. struct udf_inode_info *iinfo = UDF_I(iter->dir);
  405. int diff = new_elen - iter->elen;
  406. /* Skip update when we already went past the last extent */
  407. if (!iter->elen)
  408. return;
  409. iter->elen = new_elen;
  410. if (iinfo->i_alloc_type == ICBTAG_FLAG_AD_SHORT)
  411. iter->epos.offset -= sizeof(struct short_ad);
  412. else if (iinfo->i_alloc_type == ICBTAG_FLAG_AD_LONG)
  413. iter->epos.offset -= sizeof(struct long_ad);
  414. udf_write_aext(iter->dir, &iter->epos, &iter->eloc, iter->elen, 1);
  415. iinfo->i_lenExtents += diff;
  416. mark_inode_dirty(iter->dir);
  417. }
  418. /* Append new block to directory. @iter is expected to point at EOF */
  419. int udf_fiiter_append_blk(struct udf_fileident_iter *iter)
  420. {
  421. struct udf_inode_info *iinfo = UDF_I(iter->dir);
  422. int blksize = 1 << iter->dir->i_blkbits;
  423. struct buffer_head *bh;
  424. sector_t block;
  425. uint32_t old_elen = iter->elen;
  426. int err;
  427. int8_t etype;
  428. if (WARN_ON_ONCE(iinfo->i_alloc_type == ICBTAG_FLAG_AD_IN_ICB))
  429. return -EINVAL;
  430. /* Round up last extent in the file */
  431. udf_fiiter_update_elen(iter, ALIGN(iter->elen, blksize));
  432. /* Allocate new block and refresh mapping information */
  433. block = iinfo->i_lenExtents >> iter->dir->i_blkbits;
  434. bh = udf_bread(iter->dir, block, 1, &err);
  435. if (!bh) {
  436. udf_fiiter_update_elen(iter, old_elen);
  437. return err;
  438. }
  439. err = inode_bmap(iter->dir, block, &iter->epos, &iter->eloc, &iter->elen,
  440. &iter->loffset, &etype);
  441. if (err <= 0 || etype != (EXT_RECORDED_ALLOCATED >> 30)) {
  442. udf_err(iter->dir->i_sb,
  443. "block %llu not allocated in directory (ino %lu)\n",
  444. (unsigned long long)block, iter->dir->i_ino);
  445. return -EFSCORRUPTED;
  446. }
  447. if (!(iter->pos & (blksize - 1))) {
  448. brelse(iter->bh[0]);
  449. iter->bh[0] = bh;
  450. } else {
  451. iter->bh[1] = bh;
  452. }
  453. return 0;
  454. }
  455. struct short_ad *udf_get_fileshortad(uint8_t *ptr, int maxoffset, uint32_t *offset,
  456. int inc)
  457. {
  458. struct short_ad *sa;
  459. if ((!ptr) || (!offset)) {
  460. pr_err("%s: invalidparms\n", __func__);
  461. return NULL;
  462. }
  463. if ((*offset + sizeof(struct short_ad)) > maxoffset)
  464. return NULL;
  465. else {
  466. sa = (struct short_ad *)ptr;
  467. if (sa->extLength == 0)
  468. return NULL;
  469. }
  470. if (inc)
  471. *offset += sizeof(struct short_ad);
  472. return sa;
  473. }
  474. struct long_ad *udf_get_filelongad(uint8_t *ptr, int maxoffset, uint32_t *offset, int inc)
  475. {
  476. struct long_ad *la;
  477. if ((!ptr) || (!offset)) {
  478. pr_err("%s: invalidparms\n", __func__);
  479. return NULL;
  480. }
  481. if ((*offset + sizeof(struct long_ad)) > maxoffset)
  482. return NULL;
  483. else {
  484. la = (struct long_ad *)ptr;
  485. if (la->extLength == 0)
  486. return NULL;
  487. }
  488. if (inc)
  489. *offset += sizeof(struct long_ad);
  490. return la;
  491. }