dir.c 11 KB

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