dir.c 12 KB

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