dir.c 11 KB

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