dir.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476
  1. // SPDX-License-Identifier: GPL-2.0
  2. /*
  3. * linux/fs/minix/dir.c
  4. *
  5. * Copyright (C) 1991, 1992 Linus Torvalds
  6. *
  7. * minix directory handling functions
  8. *
  9. * Updated to filesystem version 3 by Daniel Aragones
  10. */
  11. #include "minix.h"
  12. #include <linux/buffer_head.h>
  13. #include <linux/highmem.h>
  14. #include <linux/swap.h>
  15. typedef struct minix_dir_entry minix_dirent;
  16. typedef struct minix3_dir_entry minix3_dirent;
  17. static int minix_readdir(struct file *, struct dir_context *);
  18. const struct file_operations minix_dir_operations = {
  19. .llseek = generic_file_llseek,
  20. .read = generic_read_dir,
  21. .iterate_shared = minix_readdir,
  22. .fsync = generic_file_fsync,
  23. };
  24. static inline void dir_put_page(struct page *page)
  25. {
  26. kunmap(page);
  27. put_page(page);
  28. }
  29. /*
  30. * Return the offset into page `page_nr' of the last valid
  31. * byte in that page, plus one.
  32. */
  33. static unsigned
  34. minix_last_byte(struct inode *inode, unsigned long page_nr)
  35. {
  36. unsigned last_byte = PAGE_SIZE;
  37. if (page_nr == (inode->i_size >> PAGE_SHIFT))
  38. last_byte = inode->i_size & (PAGE_SIZE - 1);
  39. return last_byte;
  40. }
  41. static void dir_commit_chunk(struct page *page, loff_t pos, unsigned len)
  42. {
  43. struct address_space *mapping = page->mapping;
  44. struct inode *dir = mapping->host;
  45. block_write_end(NULL, mapping, pos, len, len, page, NULL);
  46. if (pos+len > dir->i_size) {
  47. i_size_write(dir, pos+len);
  48. mark_inode_dirty(dir);
  49. }
  50. unlock_page(page);
  51. }
  52. static int minix_handle_dirsync(struct inode *dir)
  53. {
  54. int err;
  55. err = filemap_write_and_wait(dir->i_mapping);
  56. if (!err)
  57. err = sync_inode_metadata(dir, 1);
  58. return err;
  59. }
  60. static struct page * dir_get_page(struct inode *dir, unsigned long n)
  61. {
  62. struct address_space *mapping = dir->i_mapping;
  63. struct page *page = read_mapping_page(mapping, n, NULL);
  64. if (!IS_ERR(page))
  65. kmap(page);
  66. return page;
  67. }
  68. static inline void *minix_next_entry(void *de, struct minix_sb_info *sbi)
  69. {
  70. return (void*)((char*)de + sbi->s_dirsize);
  71. }
  72. static int minix_readdir(struct file *file, struct dir_context *ctx)
  73. {
  74. struct inode *inode = file_inode(file);
  75. struct super_block *sb = inode->i_sb;
  76. struct minix_sb_info *sbi = minix_sb(sb);
  77. unsigned chunk_size = sbi->s_dirsize;
  78. unsigned long npages = dir_pages(inode);
  79. unsigned long pos = ctx->pos;
  80. unsigned offset;
  81. unsigned long n;
  82. ctx->pos = pos = ALIGN(pos, chunk_size);
  83. if (pos >= inode->i_size)
  84. return 0;
  85. offset = pos & ~PAGE_MASK;
  86. n = pos >> PAGE_SHIFT;
  87. for ( ; n < npages; n++, offset = 0) {
  88. char *p, *kaddr, *limit;
  89. struct page *page = dir_get_page(inode, n);
  90. if (IS_ERR(page))
  91. continue;
  92. kaddr = (char *)page_address(page);
  93. p = kaddr+offset;
  94. limit = kaddr + minix_last_byte(inode, n) - chunk_size;
  95. for ( ; p <= limit; p = minix_next_entry(p, sbi)) {
  96. const char *name;
  97. __u32 inumber;
  98. if (sbi->s_version == MINIX_V3) {
  99. minix3_dirent *de3 = (minix3_dirent *)p;
  100. name = de3->name;
  101. inumber = de3->inode;
  102. } else {
  103. minix_dirent *de = (minix_dirent *)p;
  104. name = de->name;
  105. inumber = de->inode;
  106. }
  107. if (inumber) {
  108. unsigned l = strnlen(name, sbi->s_namelen);
  109. if (!dir_emit(ctx, name, l,
  110. inumber, DT_UNKNOWN)) {
  111. dir_put_page(page);
  112. return 0;
  113. }
  114. }
  115. ctx->pos += chunk_size;
  116. }
  117. dir_put_page(page);
  118. }
  119. return 0;
  120. }
  121. static inline int namecompare(int len, int maxlen,
  122. const char * name, const char * buffer)
  123. {
  124. if (len < maxlen && buffer[len])
  125. return 0;
  126. return !memcmp(name, buffer, len);
  127. }
  128. /*
  129. * minix_find_entry()
  130. *
  131. * finds an entry in the specified directory with the wanted name. It
  132. * returns the cache buffer in which the entry was found, and the entry
  133. * itself (as a parameter - res_dir). It does NOT read the inode of the
  134. * entry - you'll have to do that yourself if you want to.
  135. */
  136. minix_dirent *minix_find_entry(struct dentry *dentry, struct page **res_page)
  137. {
  138. const char * name = dentry->d_name.name;
  139. int namelen = dentry->d_name.len;
  140. struct inode * dir = d_inode(dentry->d_parent);
  141. struct super_block * sb = dir->i_sb;
  142. struct minix_sb_info * sbi = minix_sb(sb);
  143. unsigned long n;
  144. unsigned long npages = dir_pages(dir);
  145. struct page *page = NULL;
  146. char *p;
  147. char *namx;
  148. __u32 inumber;
  149. *res_page = NULL;
  150. for (n = 0; n < npages; n++) {
  151. char *kaddr, *limit;
  152. page = dir_get_page(dir, n);
  153. if (IS_ERR(page))
  154. continue;
  155. kaddr = (char*)page_address(page);
  156. limit = kaddr + minix_last_byte(dir, n) - sbi->s_dirsize;
  157. for (p = kaddr; p <= limit; p = minix_next_entry(p, sbi)) {
  158. if (sbi->s_version == MINIX_V3) {
  159. minix3_dirent *de3 = (minix3_dirent *)p;
  160. namx = de3->name;
  161. inumber = de3->inode;
  162. } else {
  163. minix_dirent *de = (minix_dirent *)p;
  164. namx = de->name;
  165. inumber = de->inode;
  166. }
  167. if (!inumber)
  168. continue;
  169. if (namecompare(namelen, sbi->s_namelen, name, namx))
  170. goto found;
  171. }
  172. dir_put_page(page);
  173. }
  174. return NULL;
  175. found:
  176. *res_page = page;
  177. return (minix_dirent *)p;
  178. }
  179. int minix_add_link(struct dentry *dentry, struct inode *inode)
  180. {
  181. struct inode *dir = d_inode(dentry->d_parent);
  182. const char * name = dentry->d_name.name;
  183. int namelen = dentry->d_name.len;
  184. struct super_block * sb = dir->i_sb;
  185. struct minix_sb_info * sbi = minix_sb(sb);
  186. struct page *page = NULL;
  187. unsigned long npages = dir_pages(dir);
  188. unsigned long n;
  189. char *kaddr, *p;
  190. minix_dirent *de;
  191. minix3_dirent *de3;
  192. loff_t pos;
  193. int err;
  194. char *namx = NULL;
  195. __u32 inumber;
  196. /*
  197. * We take care of directory expansion in the same loop
  198. * This code plays outside i_size, so it locks the page
  199. * to protect that region.
  200. */
  201. for (n = 0; n <= npages; n++) {
  202. char *limit, *dir_end;
  203. page = dir_get_page(dir, n);
  204. err = PTR_ERR(page);
  205. if (IS_ERR(page))
  206. goto out;
  207. lock_page(page);
  208. kaddr = (char*)page_address(page);
  209. dir_end = kaddr + minix_last_byte(dir, n);
  210. limit = kaddr + PAGE_SIZE - sbi->s_dirsize;
  211. for (p = kaddr; p <= limit; p = minix_next_entry(p, sbi)) {
  212. de = (minix_dirent *)p;
  213. de3 = (minix3_dirent *)p;
  214. if (sbi->s_version == MINIX_V3) {
  215. namx = de3->name;
  216. inumber = de3->inode;
  217. } else {
  218. namx = de->name;
  219. inumber = de->inode;
  220. }
  221. if (p == dir_end) {
  222. /* We hit i_size */
  223. if (sbi->s_version == MINIX_V3)
  224. de3->inode = 0;
  225. else
  226. de->inode = 0;
  227. goto got_it;
  228. }
  229. if (!inumber)
  230. goto got_it;
  231. err = -EEXIST;
  232. if (namecompare(namelen, sbi->s_namelen, name, namx))
  233. goto out_unlock;
  234. }
  235. unlock_page(page);
  236. dir_put_page(page);
  237. }
  238. BUG();
  239. return -EINVAL;
  240. got_it:
  241. pos = page_offset(page) + p - (char *)page_address(page);
  242. err = minix_prepare_chunk(page, pos, sbi->s_dirsize);
  243. if (err)
  244. goto out_unlock;
  245. memcpy (namx, name, namelen);
  246. if (sbi->s_version == MINIX_V3) {
  247. memset (namx + namelen, 0, sbi->s_dirsize - namelen - 4);
  248. de3->inode = inode->i_ino;
  249. } else {
  250. memset (namx + namelen, 0, sbi->s_dirsize - namelen - 2);
  251. de->inode = inode->i_ino;
  252. }
  253. dir_commit_chunk(page, pos, sbi->s_dirsize);
  254. inode_set_mtime_to_ts(dir, inode_set_ctime_current(dir));
  255. mark_inode_dirty(dir);
  256. err = minix_handle_dirsync(dir);
  257. out_put:
  258. dir_put_page(page);
  259. out:
  260. return err;
  261. out_unlock:
  262. unlock_page(page);
  263. goto out_put;
  264. }
  265. int minix_delete_entry(struct minix_dir_entry *de, struct page *page)
  266. {
  267. struct inode *inode = page->mapping->host;
  268. char *kaddr = page_address(page);
  269. loff_t pos = page_offset(page) + (char*)de - kaddr;
  270. struct minix_sb_info *sbi = minix_sb(inode->i_sb);
  271. unsigned len = sbi->s_dirsize;
  272. int err;
  273. lock_page(page);
  274. err = minix_prepare_chunk(page, pos, len);
  275. if (err) {
  276. unlock_page(page);
  277. return err;
  278. }
  279. if (sbi->s_version == MINIX_V3)
  280. ((minix3_dirent *)de)->inode = 0;
  281. else
  282. de->inode = 0;
  283. dir_commit_chunk(page, pos, len);
  284. inode_set_mtime_to_ts(inode, inode_set_ctime_current(inode));
  285. mark_inode_dirty(inode);
  286. return minix_handle_dirsync(inode);
  287. }
  288. int minix_make_empty(struct inode *inode, struct inode *dir)
  289. {
  290. struct page *page = grab_cache_page(inode->i_mapping, 0);
  291. struct minix_sb_info *sbi = minix_sb(inode->i_sb);
  292. char *kaddr;
  293. int err;
  294. if (!page)
  295. return -ENOMEM;
  296. err = minix_prepare_chunk(page, 0, 2 * sbi->s_dirsize);
  297. if (err) {
  298. unlock_page(page);
  299. goto fail;
  300. }
  301. kaddr = kmap_atomic(page);
  302. memset(kaddr, 0, PAGE_SIZE);
  303. if (sbi->s_version == MINIX_V3) {
  304. minix3_dirent *de3 = (minix3_dirent *)kaddr;
  305. de3->inode = inode->i_ino;
  306. strcpy(de3->name, ".");
  307. de3 = minix_next_entry(de3, sbi);
  308. de3->inode = dir->i_ino;
  309. strcpy(de3->name, "..");
  310. } else {
  311. minix_dirent *de = (minix_dirent *)kaddr;
  312. de->inode = inode->i_ino;
  313. strcpy(de->name, ".");
  314. de = minix_next_entry(de, sbi);
  315. de->inode = dir->i_ino;
  316. strcpy(de->name, "..");
  317. }
  318. kunmap_atomic(kaddr);
  319. dir_commit_chunk(page, 0, 2 * sbi->s_dirsize);
  320. err = minix_handle_dirsync(inode);
  321. fail:
  322. put_page(page);
  323. return err;
  324. }
  325. /*
  326. * routine to check that the specified directory is empty (for rmdir)
  327. */
  328. int minix_empty_dir(struct inode * inode)
  329. {
  330. struct page *page = NULL;
  331. unsigned long i, npages = dir_pages(inode);
  332. struct minix_sb_info *sbi = minix_sb(inode->i_sb);
  333. char *name;
  334. __u32 inumber;
  335. for (i = 0; i < npages; i++) {
  336. char *p, *kaddr, *limit;
  337. page = dir_get_page(inode, i);
  338. if (IS_ERR(page))
  339. continue;
  340. kaddr = (char *)page_address(page);
  341. limit = kaddr + minix_last_byte(inode, i) - sbi->s_dirsize;
  342. for (p = kaddr; p <= limit; p = minix_next_entry(p, sbi)) {
  343. if (sbi->s_version == MINIX_V3) {
  344. minix3_dirent *de3 = (minix3_dirent *)p;
  345. name = de3->name;
  346. inumber = de3->inode;
  347. } else {
  348. minix_dirent *de = (minix_dirent *)p;
  349. name = de->name;
  350. inumber = de->inode;
  351. }
  352. if (inumber != 0) {
  353. /* check for . and .. */
  354. if (name[0] != '.')
  355. goto not_empty;
  356. if (!name[1]) {
  357. if (inumber != inode->i_ino)
  358. goto not_empty;
  359. } else if (name[1] != '.')
  360. goto not_empty;
  361. else if (name[2])
  362. goto not_empty;
  363. }
  364. }
  365. dir_put_page(page);
  366. }
  367. return 1;
  368. not_empty:
  369. dir_put_page(page);
  370. return 0;
  371. }
  372. /* Releases the page */
  373. int minix_set_link(struct minix_dir_entry *de, struct page *page,
  374. struct inode *inode)
  375. {
  376. struct inode *dir = page->mapping->host;
  377. struct minix_sb_info *sbi = minix_sb(dir->i_sb);
  378. loff_t pos = page_offset(page) +
  379. (char *)de-(char*)page_address(page);
  380. int err;
  381. lock_page(page);
  382. err = minix_prepare_chunk(page, pos, sbi->s_dirsize);
  383. if (err) {
  384. unlock_page(page);
  385. return err;
  386. }
  387. if (sbi->s_version == MINIX_V3)
  388. ((minix3_dirent *)de)->inode = inode->i_ino;
  389. else
  390. de->inode = inode->i_ino;
  391. dir_commit_chunk(page, pos, sbi->s_dirsize);
  392. inode_set_mtime_to_ts(dir, inode_set_ctime_current(dir));
  393. mark_inode_dirty(dir);
  394. return minix_handle_dirsync(dir);
  395. }
  396. struct minix_dir_entry * minix_dotdot (struct inode *dir, struct page **p)
  397. {
  398. struct page *page = dir_get_page(dir, 0);
  399. struct minix_sb_info *sbi = minix_sb(dir->i_sb);
  400. struct minix_dir_entry *de = NULL;
  401. if (!IS_ERR(page)) {
  402. de = minix_next_entry(page_address(page), sbi);
  403. *p = page;
  404. }
  405. return de;
  406. }
  407. ino_t minix_inode_by_name(struct dentry *dentry)
  408. {
  409. struct page *page;
  410. struct minix_dir_entry *de = minix_find_entry(dentry, &page);
  411. ino_t res = 0;
  412. if (de) {
  413. struct address_space *mapping = page->mapping;
  414. struct inode *inode = mapping->host;
  415. struct minix_sb_info *sbi = minix_sb(inode->i_sb);
  416. if (sbi->s_version == MINIX_V3)
  417. res = ((minix3_dirent *) de)->inode;
  418. else
  419. res = de->inode;
  420. dir_put_page(page);
  421. }
  422. return res;
  423. }