dir.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657
  1. // SPDX-License-Identifier: GPL-2.0
  2. /*
  3. * linux/fs/ufs/ufs_dir.c
  4. *
  5. * Copyright (C) 1996
  6. * Adrian Rodriguez (adrian@franklins-tower.rutgers.edu)
  7. * Laboratory for Computer Science Research Computing Facility
  8. * Rutgers, The State University of New Jersey
  9. *
  10. * swab support by Francois-Rene Rideau <fare@tunes.org> 19970406
  11. *
  12. * 4.4BSD (FreeBSD) support added on February 1st 1998 by
  13. * Niels Kristian Bech Jensen <nkbj@image.dk> partially based
  14. * on code by Martin von Loewis <martin@mira.isdn.cs.tu-berlin.de>.
  15. *
  16. * Migration to usage of "page cache" on May 2006 by
  17. * Evgeniy Dushistov <dushistov@mail.ru> based on ext2 code base.
  18. */
  19. #include <linux/time.h>
  20. #include <linux/fs.h>
  21. #include <linux/swap.h>
  22. #include <linux/iversion.h>
  23. #include "ufs_fs.h"
  24. #include "ufs.h"
  25. #include "swab.h"
  26. #include "util.h"
  27. /*
  28. * NOTE! unlike strncmp, ufs_match returns 1 for success, 0 for failure.
  29. *
  30. * len <= UFS_MAXNAMLEN and de != NULL are guaranteed by caller.
  31. */
  32. static inline int ufs_match(struct super_block *sb, int len,
  33. const unsigned char *name, struct ufs_dir_entry *de)
  34. {
  35. if (len != ufs_get_de_namlen(sb, de))
  36. return 0;
  37. if (!de->d_ino)
  38. return 0;
  39. return !memcmp(name, de->d_name, len);
  40. }
  41. static void ufs_commit_chunk(struct folio *folio, loff_t pos, unsigned len)
  42. {
  43. struct address_space *mapping = folio->mapping;
  44. struct inode *dir = mapping->host;
  45. inode_inc_iversion(dir);
  46. block_write_end(NULL, mapping, pos, len, len, folio, NULL);
  47. if (pos+len > dir->i_size) {
  48. i_size_write(dir, pos+len);
  49. mark_inode_dirty(dir);
  50. }
  51. folio_unlock(folio);
  52. }
  53. static int ufs_handle_dirsync(struct inode *dir)
  54. {
  55. int err;
  56. err = filemap_write_and_wait(dir->i_mapping);
  57. if (!err)
  58. err = sync_inode_metadata(dir, 1);
  59. return err;
  60. }
  61. ino_t ufs_inode_by_name(struct inode *dir, const struct qstr *qstr)
  62. {
  63. ino_t res = 0;
  64. struct ufs_dir_entry *de;
  65. struct folio *folio;
  66. de = ufs_find_entry(dir, qstr, &folio);
  67. if (de) {
  68. res = fs32_to_cpu(dir->i_sb, de->d_ino);
  69. folio_release_kmap(folio, de);
  70. }
  71. return res;
  72. }
  73. /* Releases the page */
  74. void ufs_set_link(struct inode *dir, struct ufs_dir_entry *de,
  75. struct folio *folio, struct inode *inode,
  76. bool update_times)
  77. {
  78. loff_t pos = folio_pos(folio) + offset_in_folio(folio, de);
  79. unsigned len = fs16_to_cpu(dir->i_sb, de->d_reclen);
  80. int err;
  81. folio_lock(folio);
  82. err = ufs_prepare_chunk(folio, pos, len);
  83. BUG_ON(err);
  84. de->d_ino = cpu_to_fs32(dir->i_sb, inode->i_ino);
  85. ufs_set_de_type(dir->i_sb, de, inode->i_mode);
  86. ufs_commit_chunk(folio, pos, len);
  87. folio_release_kmap(folio, de);
  88. if (update_times)
  89. inode_set_mtime_to_ts(dir, inode_set_ctime_current(dir));
  90. mark_inode_dirty(dir);
  91. ufs_handle_dirsync(dir);
  92. }
  93. static bool ufs_check_folio(struct folio *folio, char *kaddr)
  94. {
  95. struct inode *dir = folio->mapping->host;
  96. struct super_block *sb = dir->i_sb;
  97. unsigned offs, rec_len;
  98. unsigned limit = folio_size(folio);
  99. const unsigned chunk_mask = UFS_SB(sb)->s_uspi->s_dirblksize - 1;
  100. struct ufs_dir_entry *p;
  101. char *error;
  102. if (dir->i_size < folio_pos(folio) + limit) {
  103. limit = offset_in_folio(folio, dir->i_size);
  104. if (limit & chunk_mask)
  105. goto Ebadsize;
  106. if (!limit)
  107. goto out;
  108. }
  109. for (offs = 0; offs <= limit - UFS_DIR_REC_LEN(1); offs += rec_len) {
  110. p = (struct ufs_dir_entry *)(kaddr + offs);
  111. rec_len = fs16_to_cpu(sb, p->d_reclen);
  112. if (rec_len < UFS_DIR_REC_LEN(1))
  113. goto Eshort;
  114. if (rec_len & 3)
  115. goto Ealign;
  116. if (rec_len < UFS_DIR_REC_LEN(ufs_get_de_namlen(sb, p)))
  117. goto Enamelen;
  118. if (((offs + rec_len - 1) ^ offs) & ~chunk_mask)
  119. goto Espan;
  120. if (fs32_to_cpu(sb, p->d_ino) > (UFS_SB(sb)->s_uspi->s_ipg *
  121. UFS_SB(sb)->s_uspi->s_ncg))
  122. goto Einumber;
  123. }
  124. if (offs != limit)
  125. goto Eend;
  126. out:
  127. folio_set_checked(folio);
  128. return true;
  129. /* Too bad, we had an error */
  130. Ebadsize:
  131. ufs_error(sb, __func__,
  132. "size of directory #%lu is not a multiple of chunk size",
  133. dir->i_ino
  134. );
  135. goto fail;
  136. Eshort:
  137. error = "rec_len is smaller than minimal";
  138. goto bad_entry;
  139. Ealign:
  140. error = "unaligned directory entry";
  141. goto bad_entry;
  142. Enamelen:
  143. error = "rec_len is too small for name_len";
  144. goto bad_entry;
  145. Espan:
  146. error = "directory entry across blocks";
  147. goto bad_entry;
  148. Einumber:
  149. error = "inode out of bounds";
  150. bad_entry:
  151. ufs_error(sb, __func__, "bad entry in directory #%lu: %s - "
  152. "offset=%llu, rec_len=%d, name_len=%d",
  153. dir->i_ino, error, folio_pos(folio) + offs,
  154. rec_len, ufs_get_de_namlen(sb, p));
  155. goto fail;
  156. Eend:
  157. p = (struct ufs_dir_entry *)(kaddr + offs);
  158. ufs_error(sb, __func__,
  159. "entry in directory #%lu spans the page boundary"
  160. "offset=%llu",
  161. dir->i_ino, folio_pos(folio) + offs);
  162. fail:
  163. return false;
  164. }
  165. static void *ufs_get_folio(struct inode *dir, unsigned long n,
  166. struct folio **foliop)
  167. {
  168. struct address_space *mapping = dir->i_mapping;
  169. struct folio *folio = read_mapping_folio(mapping, n, NULL);
  170. void *kaddr;
  171. if (IS_ERR(folio))
  172. return ERR_CAST(folio);
  173. kaddr = kmap_local_folio(folio, 0);
  174. if (unlikely(!folio_test_checked(folio))) {
  175. if (!ufs_check_folio(folio, kaddr))
  176. goto fail;
  177. }
  178. *foliop = folio;
  179. return kaddr;
  180. fail:
  181. folio_release_kmap(folio, kaddr);
  182. return ERR_PTR(-EIO);
  183. }
  184. /*
  185. * Return the offset into page `page_nr' of the last valid
  186. * byte in that page, plus one.
  187. */
  188. static unsigned
  189. ufs_last_byte(struct inode *inode, unsigned long page_nr)
  190. {
  191. unsigned last_byte = inode->i_size;
  192. last_byte -= page_nr << PAGE_SHIFT;
  193. if (last_byte > PAGE_SIZE)
  194. last_byte = PAGE_SIZE;
  195. return last_byte;
  196. }
  197. static inline struct ufs_dir_entry *
  198. ufs_next_entry(struct super_block *sb, struct ufs_dir_entry *p)
  199. {
  200. return (struct ufs_dir_entry *)((char *)p +
  201. fs16_to_cpu(sb, p->d_reclen));
  202. }
  203. struct ufs_dir_entry *ufs_dotdot(struct inode *dir, struct folio **foliop)
  204. {
  205. struct ufs_dir_entry *de = ufs_get_folio(dir, 0, foliop);
  206. if (!IS_ERR(de))
  207. return ufs_next_entry(dir->i_sb, de);
  208. return NULL;
  209. }
  210. /*
  211. * ufs_find_entry()
  212. *
  213. * finds an entry in the specified directory with the wanted name. It
  214. * returns the page in which the entry was found, and the entry itself
  215. * (as a parameter - res_dir). Page is returned mapped and unlocked.
  216. * Entry is guaranteed to be valid.
  217. */
  218. struct ufs_dir_entry *ufs_find_entry(struct inode *dir, const struct qstr *qstr,
  219. struct folio **foliop)
  220. {
  221. struct super_block *sb = dir->i_sb;
  222. const unsigned char *name = qstr->name;
  223. int namelen = qstr->len;
  224. unsigned reclen = UFS_DIR_REC_LEN(namelen);
  225. unsigned long start, n;
  226. unsigned long npages = dir_pages(dir);
  227. struct ufs_inode_info *ui = UFS_I(dir);
  228. struct ufs_dir_entry *de;
  229. UFSD("ENTER, dir_ino %lu, name %s, namlen %u\n", dir->i_ino, name, namelen);
  230. if (npages == 0 || namelen > UFS_MAXNAMLEN)
  231. goto out;
  232. start = ui->i_dir_start_lookup;
  233. if (start >= npages)
  234. start = 0;
  235. n = start;
  236. do {
  237. char *kaddr = ufs_get_folio(dir, n, foliop);
  238. if (!IS_ERR(kaddr)) {
  239. de = (struct ufs_dir_entry *)kaddr;
  240. kaddr += ufs_last_byte(dir, n) - reclen;
  241. while ((char *) de <= kaddr) {
  242. if (ufs_match(sb, namelen, name, de))
  243. goto found;
  244. de = ufs_next_entry(sb, de);
  245. }
  246. folio_release_kmap(*foliop, kaddr);
  247. }
  248. if (++n >= npages)
  249. n = 0;
  250. } while (n != start);
  251. out:
  252. return NULL;
  253. found:
  254. ui->i_dir_start_lookup = n;
  255. return de;
  256. }
  257. /*
  258. * Parent is locked.
  259. */
  260. int ufs_add_link(struct dentry *dentry, struct inode *inode)
  261. {
  262. struct inode *dir = d_inode(dentry->d_parent);
  263. const unsigned char *name = dentry->d_name.name;
  264. int namelen = dentry->d_name.len;
  265. struct super_block *sb = dir->i_sb;
  266. unsigned reclen = UFS_DIR_REC_LEN(namelen);
  267. const unsigned int chunk_size = UFS_SB(sb)->s_uspi->s_dirblksize;
  268. unsigned short rec_len, name_len;
  269. struct folio *folio = NULL;
  270. struct ufs_dir_entry *de;
  271. unsigned long npages = dir_pages(dir);
  272. unsigned long n;
  273. loff_t pos;
  274. int err;
  275. UFSD("ENTER, name %s, namelen %u\n", name, namelen);
  276. /*
  277. * We take care of directory expansion in the same loop.
  278. * This code plays outside i_size, so it locks the folio
  279. * to protect that region.
  280. */
  281. for (n = 0; n <= npages; n++) {
  282. char *kaddr = ufs_get_folio(dir, n, &folio);
  283. char *dir_end;
  284. if (IS_ERR(kaddr))
  285. return PTR_ERR(kaddr);
  286. folio_lock(folio);
  287. dir_end = kaddr + ufs_last_byte(dir, n);
  288. de = (struct ufs_dir_entry *)kaddr;
  289. kaddr += folio_size(folio) - reclen;
  290. while ((char *)de <= kaddr) {
  291. if ((char *)de == dir_end) {
  292. /* We hit i_size */
  293. name_len = 0;
  294. rec_len = chunk_size;
  295. de->d_reclen = cpu_to_fs16(sb, chunk_size);
  296. de->d_ino = 0;
  297. goto got_it;
  298. }
  299. if (de->d_reclen == 0) {
  300. ufs_error(dir->i_sb, __func__,
  301. "zero-length directory entry");
  302. err = -EIO;
  303. goto out_unlock;
  304. }
  305. err = -EEXIST;
  306. if (ufs_match(sb, namelen, name, de))
  307. goto out_unlock;
  308. name_len = UFS_DIR_REC_LEN(ufs_get_de_namlen(sb, de));
  309. rec_len = fs16_to_cpu(sb, de->d_reclen);
  310. if (!de->d_ino && rec_len >= reclen)
  311. goto got_it;
  312. if (rec_len >= name_len + reclen)
  313. goto got_it;
  314. de = (struct ufs_dir_entry *) ((char *) de + rec_len);
  315. }
  316. folio_unlock(folio);
  317. folio_release_kmap(folio, kaddr);
  318. }
  319. BUG();
  320. return -EINVAL;
  321. got_it:
  322. pos = folio_pos(folio) + offset_in_folio(folio, de);
  323. err = ufs_prepare_chunk(folio, pos, rec_len);
  324. if (err)
  325. goto out_unlock;
  326. if (de->d_ino) {
  327. struct ufs_dir_entry *de1 =
  328. (struct ufs_dir_entry *) ((char *) de + name_len);
  329. de1->d_reclen = cpu_to_fs16(sb, rec_len - name_len);
  330. de->d_reclen = cpu_to_fs16(sb, name_len);
  331. de = de1;
  332. }
  333. ufs_set_de_namlen(sb, de, namelen);
  334. memcpy(de->d_name, name, namelen + 1);
  335. de->d_ino = cpu_to_fs32(sb, inode->i_ino);
  336. ufs_set_de_type(sb, de, inode->i_mode);
  337. ufs_commit_chunk(folio, pos, rec_len);
  338. inode_set_mtime_to_ts(dir, inode_set_ctime_current(dir));
  339. mark_inode_dirty(dir);
  340. err = ufs_handle_dirsync(dir);
  341. /* OFFSET_CACHE */
  342. out_put:
  343. folio_release_kmap(folio, de);
  344. return err;
  345. out_unlock:
  346. folio_unlock(folio);
  347. goto out_put;
  348. }
  349. static inline unsigned
  350. ufs_validate_entry(struct super_block *sb, char *base,
  351. unsigned offset, unsigned mask)
  352. {
  353. struct ufs_dir_entry *de = (struct ufs_dir_entry*)(base + offset);
  354. struct ufs_dir_entry *p = (struct ufs_dir_entry*)(base + (offset&mask));
  355. while ((char*)p < (char*)de)
  356. p = ufs_next_entry(sb, p);
  357. return (char *)p - base;
  358. }
  359. /*
  360. * This is blatantly stolen from ext2fs
  361. */
  362. static int
  363. ufs_readdir(struct file *file, struct dir_context *ctx)
  364. {
  365. loff_t pos = ctx->pos;
  366. struct inode *inode = file_inode(file);
  367. struct super_block *sb = inode->i_sb;
  368. unsigned int offset = pos & ~PAGE_MASK;
  369. unsigned long n = pos >> PAGE_SHIFT;
  370. unsigned long npages = dir_pages(inode);
  371. unsigned chunk_mask = ~(UFS_SB(sb)->s_uspi->s_dirblksize - 1);
  372. bool need_revalidate = !inode_eq_iversion(inode, *(u64 *)file->private_data);
  373. unsigned flags = UFS_SB(sb)->s_flags;
  374. UFSD("BEGIN\n");
  375. if (pos > inode->i_size - UFS_DIR_REC_LEN(1))
  376. return 0;
  377. for ( ; n < npages; n++, offset = 0) {
  378. struct ufs_dir_entry *de;
  379. struct folio *folio;
  380. char *kaddr = ufs_get_folio(inode, n, &folio);
  381. char *limit;
  382. if (IS_ERR(kaddr)) {
  383. ufs_error(sb, __func__,
  384. "bad page in #%lu",
  385. inode->i_ino);
  386. ctx->pos += PAGE_SIZE - offset;
  387. return PTR_ERR(kaddr);
  388. }
  389. if (unlikely(need_revalidate)) {
  390. if (offset) {
  391. offset = ufs_validate_entry(sb, kaddr, offset, chunk_mask);
  392. ctx->pos = (n<<PAGE_SHIFT) + offset;
  393. }
  394. *(u64 *)file->private_data = inode_query_iversion(inode);
  395. need_revalidate = false;
  396. }
  397. de = (struct ufs_dir_entry *)(kaddr+offset);
  398. limit = kaddr + ufs_last_byte(inode, n) - UFS_DIR_REC_LEN(1);
  399. for ( ;(char*)de <= limit; de = ufs_next_entry(sb, de)) {
  400. if (de->d_ino) {
  401. unsigned char d_type = DT_UNKNOWN;
  402. UFSD("filldir(%s,%u)\n", de->d_name,
  403. fs32_to_cpu(sb, de->d_ino));
  404. UFSD("namlen %u\n", ufs_get_de_namlen(sb, de));
  405. if ((flags & UFS_DE_MASK) == UFS_DE_44BSD)
  406. d_type = de->d_u.d_44.d_type;
  407. if (!dir_emit(ctx, de->d_name,
  408. ufs_get_de_namlen(sb, de),
  409. fs32_to_cpu(sb, de->d_ino),
  410. d_type)) {
  411. folio_release_kmap(folio, de);
  412. return 0;
  413. }
  414. }
  415. ctx->pos += fs16_to_cpu(sb, de->d_reclen);
  416. }
  417. folio_release_kmap(folio, kaddr);
  418. }
  419. return 0;
  420. }
  421. /*
  422. * ufs_delete_entry deletes a directory entry by merging it with the
  423. * previous entry.
  424. */
  425. int ufs_delete_entry(struct inode *inode, struct ufs_dir_entry *dir,
  426. struct folio *folio)
  427. {
  428. struct super_block *sb = inode->i_sb;
  429. size_t from, to;
  430. char *kaddr;
  431. loff_t pos;
  432. struct ufs_dir_entry *de, *pde = NULL;
  433. int err;
  434. UFSD("ENTER\n");
  435. from = offset_in_folio(folio, dir);
  436. to = from + fs16_to_cpu(sb, dir->d_reclen);
  437. kaddr = (char *)dir - from;
  438. from &= ~(UFS_SB(sb)->s_uspi->s_dirblksize - 1);
  439. de = (struct ufs_dir_entry *) (kaddr + from);
  440. UFSD("ino %u, reclen %u, namlen %u, name %s\n",
  441. fs32_to_cpu(sb, de->d_ino),
  442. fs16_to_cpu(sb, de->d_reclen),
  443. ufs_get_de_namlen(sb, de), de->d_name);
  444. while ((char*)de < (char*)dir) {
  445. if (de->d_reclen == 0) {
  446. ufs_error(inode->i_sb, __func__,
  447. "zero-length directory entry");
  448. err = -EIO;
  449. goto out;
  450. }
  451. pde = de;
  452. de = ufs_next_entry(sb, de);
  453. }
  454. if (pde)
  455. from = offset_in_folio(folio, pde);
  456. pos = folio_pos(folio) + from;
  457. folio_lock(folio);
  458. err = ufs_prepare_chunk(folio, pos, to - from);
  459. BUG_ON(err);
  460. if (pde)
  461. pde->d_reclen = cpu_to_fs16(sb, to - from);
  462. dir->d_ino = 0;
  463. ufs_commit_chunk(folio, pos, to - from);
  464. inode_set_mtime_to_ts(inode, inode_set_ctime_current(inode));
  465. mark_inode_dirty(inode);
  466. err = ufs_handle_dirsync(inode);
  467. out:
  468. folio_release_kmap(folio, kaddr);
  469. UFSD("EXIT\n");
  470. return err;
  471. }
  472. int ufs_make_empty(struct inode * inode, struct inode *dir)
  473. {
  474. struct super_block * sb = dir->i_sb;
  475. struct address_space *mapping = inode->i_mapping;
  476. struct folio *folio = filemap_grab_folio(mapping, 0);
  477. const unsigned int chunk_size = UFS_SB(sb)->s_uspi->s_dirblksize;
  478. struct ufs_dir_entry * de;
  479. int err;
  480. char *kaddr;
  481. if (IS_ERR(folio))
  482. return PTR_ERR(folio);
  483. err = ufs_prepare_chunk(folio, 0, chunk_size);
  484. if (err) {
  485. folio_unlock(folio);
  486. goto fail;
  487. }
  488. kaddr = kmap_local_folio(folio, 0);
  489. memset(kaddr, 0, folio_size(folio));
  490. de = (struct ufs_dir_entry *)kaddr;
  491. de->d_ino = cpu_to_fs32(sb, inode->i_ino);
  492. ufs_set_de_type(sb, de, inode->i_mode);
  493. ufs_set_de_namlen(sb, de, 1);
  494. de->d_reclen = cpu_to_fs16(sb, UFS_DIR_REC_LEN(1));
  495. strcpy (de->d_name, ".");
  496. de = (struct ufs_dir_entry *)
  497. ((char *)de + fs16_to_cpu(sb, de->d_reclen));
  498. de->d_ino = cpu_to_fs32(sb, dir->i_ino);
  499. ufs_set_de_type(sb, de, dir->i_mode);
  500. de->d_reclen = cpu_to_fs16(sb, chunk_size - UFS_DIR_REC_LEN(1));
  501. ufs_set_de_namlen(sb, de, 2);
  502. strcpy (de->d_name, "..");
  503. kunmap_local(kaddr);
  504. ufs_commit_chunk(folio, 0, chunk_size);
  505. err = ufs_handle_dirsync(inode);
  506. fail:
  507. folio_put(folio);
  508. return err;
  509. }
  510. /*
  511. * routine to check that the specified directory is empty (for rmdir)
  512. */
  513. int ufs_empty_dir(struct inode * inode)
  514. {
  515. struct super_block *sb = inode->i_sb;
  516. struct folio *folio;
  517. char *kaddr;
  518. unsigned long i, npages = dir_pages(inode);
  519. for (i = 0; i < npages; i++) {
  520. struct ufs_dir_entry *de;
  521. kaddr = ufs_get_folio(inode, i, &folio);
  522. if (IS_ERR(kaddr))
  523. continue;
  524. de = (struct ufs_dir_entry *)kaddr;
  525. kaddr += ufs_last_byte(inode, i) - UFS_DIR_REC_LEN(1);
  526. while ((char *)de <= kaddr) {
  527. if (de->d_reclen == 0) {
  528. ufs_error(inode->i_sb, __func__,
  529. "zero-length directory entry: "
  530. "kaddr=%p, de=%p\n", kaddr, de);
  531. goto not_empty;
  532. }
  533. if (de->d_ino) {
  534. u16 namelen=ufs_get_de_namlen(sb, de);
  535. /* check for . and .. */
  536. if (de->d_name[0] != '.')
  537. goto not_empty;
  538. if (namelen > 2)
  539. goto not_empty;
  540. if (namelen < 2) {
  541. if (inode->i_ino !=
  542. fs32_to_cpu(sb, de->d_ino))
  543. goto not_empty;
  544. } else if (de->d_name[1] != '.')
  545. goto not_empty;
  546. }
  547. de = ufs_next_entry(sb, de);
  548. }
  549. folio_release_kmap(folio, kaddr);
  550. }
  551. return 1;
  552. not_empty:
  553. folio_release_kmap(folio, kaddr);
  554. return 0;
  555. }
  556. static int ufs_dir_open(struct inode *inode, struct file *file)
  557. {
  558. file->private_data = kzalloc(sizeof(u64), GFP_KERNEL);
  559. if (!file->private_data)
  560. return -ENOMEM;
  561. return 0;
  562. }
  563. static int ufs_dir_release(struct inode *inode, struct file *file)
  564. {
  565. kfree(file->private_data);
  566. return 0;
  567. }
  568. static loff_t ufs_dir_llseek(struct file *file, loff_t offset, int whence)
  569. {
  570. return generic_llseek_cookie(file, offset, whence,
  571. (u64 *)file->private_data);
  572. }
  573. const struct file_operations ufs_dir_operations = {
  574. .open = ufs_dir_open,
  575. .release = ufs_dir_release,
  576. .read = generic_read_dir,
  577. .iterate_shared = ufs_readdir,
  578. .fsync = generic_file_fsync,
  579. .llseek = ufs_dir_llseek,
  580. };