dir.c 11 KB

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