dir.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467
  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/highmem.h>
  12. #include <linux/smp_lock.h>
  13. typedef struct minix_dir_entry minix_dirent;
  14. typedef struct minix3_dir_entry minix3_dirent;
  15. static int minix_readdir(struct file *, void *, filldir_t);
  16. const struct file_operations minix_dir_operations = {
  17. .read = generic_read_dir,
  18. .readdir = minix_readdir,
  19. .fsync = minix_sync_file,
  20. };
  21. static inline void dir_put_page(struct page *page)
  22. {
  23. kunmap(page);
  24. page_cache_release(page);
  25. }
  26. /*
  27. * Return the offset into page `page_nr' of the last valid
  28. * byte in that page, plus one.
  29. */
  30. static unsigned
  31. minix_last_byte(struct inode *inode, unsigned long page_nr)
  32. {
  33. unsigned last_byte = PAGE_CACHE_SIZE;
  34. if (page_nr == (inode->i_size >> PAGE_CACHE_SHIFT))
  35. last_byte = inode->i_size & (PAGE_CACHE_SIZE - 1);
  36. return last_byte;
  37. }
  38. static inline unsigned long dir_pages(struct inode *inode)
  39. {
  40. return (inode->i_size+PAGE_CACHE_SIZE-1)>>PAGE_CACHE_SHIFT;
  41. }
  42. static int dir_commit_chunk(struct page *page, unsigned from, unsigned to)
  43. {
  44. struct inode *dir = (struct inode *)page->mapping->host;
  45. int err = 0;
  46. page->mapping->a_ops->commit_write(NULL, page, from, to);
  47. if (IS_DIRSYNC(dir))
  48. err = write_one_page(page, 1);
  49. else
  50. unlock_page(page);
  51. return err;
  52. }
  53. static struct page * dir_get_page(struct inode *dir, unsigned long n)
  54. {
  55. struct address_space *mapping = dir->i_mapping;
  56. struct page *page = read_mapping_page(mapping, n, NULL);
  57. if (!IS_ERR(page)) {
  58. kmap(page);
  59. if (!PageUptodate(page))
  60. goto fail;
  61. }
  62. return page;
  63. fail:
  64. dir_put_page(page);
  65. return ERR_PTR(-EIO);
  66. }
  67. static inline void *minix_next_entry(void *de, struct minix_sb_info *sbi)
  68. {
  69. return (void*)((char*)de + sbi->s_dirsize);
  70. }
  71. static int minix_readdir(struct file * filp, void * dirent, filldir_t filldir)
  72. {
  73. unsigned long pos = filp->f_pos;
  74. struct inode *inode = filp->f_path.dentry->d_inode;
  75. struct super_block *sb = inode->i_sb;
  76. unsigned offset = pos & ~PAGE_CACHE_MASK;
  77. unsigned long n = pos >> PAGE_CACHE_SHIFT;
  78. unsigned long npages = dir_pages(inode);
  79. struct minix_sb_info *sbi = minix_sb(sb);
  80. unsigned chunk_size = sbi->s_dirsize;
  81. char *name;
  82. __u32 inumber;
  83. lock_kernel();
  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. unlock_kernel();
  123. return 0;
  124. }
  125. static inline int namecompare(int len, int maxlen,
  126. const char * name, const char * buffer)
  127. {
  128. if (len < maxlen && buffer[len])
  129. return 0;
  130. return !memcmp(name, buffer, len);
  131. }
  132. /*
  133. * minix_find_entry()
  134. *
  135. * finds an entry in the specified directory with the wanted name. It
  136. * returns the cache buffer in which the entry was found, and the entry
  137. * itself (as a parameter - res_dir). It does NOT read the inode of the
  138. * entry - you'll have to do that yourself if you want to.
  139. */
  140. minix_dirent *minix_find_entry(struct dentry *dentry, struct page **res_page)
  141. {
  142. const char * name = dentry->d_name.name;
  143. int namelen = dentry->d_name.len;
  144. struct inode * dir = dentry->d_parent->d_inode;
  145. struct super_block * sb = dir->i_sb;
  146. struct minix_sb_info * sbi = minix_sb(sb);
  147. unsigned long n;
  148. unsigned long npages = dir_pages(dir);
  149. struct page *page = NULL;
  150. char *p;
  151. char *namx;
  152. __u32 inumber;
  153. *res_page = NULL;
  154. for (n = 0; n < npages; n++) {
  155. char *kaddr, *limit;
  156. page = dir_get_page(dir, n);
  157. if (IS_ERR(page))
  158. continue;
  159. kaddr = (char*)page_address(page);
  160. limit = kaddr + minix_last_byte(dir, n) - sbi->s_dirsize;
  161. for (p = kaddr; p <= limit; p = minix_next_entry(p, sbi)) {
  162. if (sbi->s_version == MINIX_V3) {
  163. minix3_dirent *de3 = (minix3_dirent *)p;
  164. namx = de3->name;
  165. inumber = de3->inode;
  166. } else {
  167. minix_dirent *de = (minix_dirent *)p;
  168. namx = de->name;
  169. inumber = de->inode;
  170. }
  171. if (!inumber)
  172. continue;
  173. if (namecompare(namelen, sbi->s_namelen, name, namx))
  174. goto found;
  175. }
  176. dir_put_page(page);
  177. }
  178. return NULL;
  179. found:
  180. *res_page = page;
  181. return (minix_dirent *)p;
  182. }
  183. int minix_add_link(struct dentry *dentry, struct inode *inode)
  184. {
  185. struct inode *dir = dentry->d_parent->d_inode;
  186. const char * name = dentry->d_name.name;
  187. int namelen = dentry->d_name.len;
  188. struct super_block * sb = dir->i_sb;
  189. struct minix_sb_info * sbi = minix_sb(sb);
  190. struct page *page = NULL;
  191. unsigned long npages = dir_pages(dir);
  192. unsigned long n;
  193. char *kaddr, *p;
  194. minix_dirent *de;
  195. minix3_dirent *de3;
  196. unsigned from, to;
  197. int err;
  198. char *namx = NULL;
  199. __u32 inumber;
  200. /*
  201. * We take care of directory expansion in the same loop
  202. * This code plays outside i_size, so it locks the page
  203. * to protect that region.
  204. */
  205. for (n = 0; n <= npages; n++) {
  206. char *limit, *dir_end;
  207. page = dir_get_page(dir, n);
  208. err = PTR_ERR(page);
  209. if (IS_ERR(page))
  210. goto out;
  211. lock_page(page);
  212. kaddr = (char*)page_address(page);
  213. dir_end = kaddr + minix_last_byte(dir, n);
  214. limit = kaddr + PAGE_CACHE_SIZE - sbi->s_dirsize;
  215. for (p = kaddr; p <= limit; p = minix_next_entry(p, sbi)) {
  216. de = (minix_dirent *)p;
  217. de3 = (minix3_dirent *)p;
  218. if (sbi->s_version == MINIX_V3) {
  219. namx = de3->name;
  220. inumber = de3->inode;
  221. } else {
  222. namx = de->name;
  223. inumber = de->inode;
  224. }
  225. if (p == dir_end) {
  226. /* We hit i_size */
  227. if (sbi->s_version == MINIX_V3)
  228. de3->inode = 0;
  229. else
  230. de->inode = 0;
  231. goto got_it;
  232. }
  233. if (!inumber)
  234. goto got_it;
  235. err = -EEXIST;
  236. if (namecompare(namelen, sbi->s_namelen, name, namx))
  237. goto out_unlock;
  238. }
  239. unlock_page(page);
  240. dir_put_page(page);
  241. }
  242. BUG();
  243. return -EINVAL;
  244. got_it:
  245. from = p - (char*)page_address(page);
  246. to = from + sbi->s_dirsize;
  247. err = page->mapping->a_ops->prepare_write(NULL, page, from, to);
  248. if (err)
  249. goto out_unlock;
  250. memcpy (namx, name, namelen);
  251. if (sbi->s_version == MINIX_V3) {
  252. memset (namx + namelen, 0, sbi->s_dirsize - namelen - 4);
  253. de3->inode = inode->i_ino;
  254. } else {
  255. memset (namx + namelen, 0, sbi->s_dirsize - namelen - 2);
  256. de->inode = inode->i_ino;
  257. }
  258. err = dir_commit_chunk(page, from, to);
  259. dir->i_mtime = dir->i_ctime = CURRENT_TIME_SEC;
  260. mark_inode_dirty(dir);
  261. out_put:
  262. dir_put_page(page);
  263. out:
  264. return err;
  265. out_unlock:
  266. unlock_page(page);
  267. goto out_put;
  268. }
  269. int minix_delete_entry(struct minix_dir_entry *de, struct page *page)
  270. {
  271. struct address_space *mapping = page->mapping;
  272. struct inode *inode = (struct inode*)mapping->host;
  273. char *kaddr = page_address(page);
  274. unsigned from = (char*)de - kaddr;
  275. unsigned to = from + minix_sb(inode->i_sb)->s_dirsize;
  276. int err;
  277. lock_page(page);
  278. err = mapping->a_ops->prepare_write(NULL, page, from, to);
  279. if (err == 0) {
  280. de->inode = 0;
  281. err = dir_commit_chunk(page, from, to);
  282. } else {
  283. unlock_page(page);
  284. }
  285. dir_put_page(page);
  286. inode->i_ctime = inode->i_mtime = CURRENT_TIME_SEC;
  287. mark_inode_dirty(inode);
  288. return err;
  289. }
  290. int minix_make_empty(struct inode *inode, struct inode *dir)
  291. {
  292. struct address_space *mapping = inode->i_mapping;
  293. struct page *page = grab_cache_page(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 = mapping->a_ops->prepare_write(NULL, page, 0, 2 * sbi->s_dirsize);
  300. if (err) {
  301. unlock_page(page);
  302. goto fail;
  303. }
  304. kaddr = kmap_atomic(page, KM_USER0);
  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, KM_USER0);
  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 = (struct inode*)page->mapping->host;
  379. struct minix_sb_info *sbi = minix_sb(dir->i_sb);
  380. unsigned from = (char *)de-(char*)page_address(page);
  381. unsigned to = from + sbi->s_dirsize;
  382. int err;
  383. lock_page(page);
  384. err = page->mapping->a_ops->prepare_write(NULL, page, from, to);
  385. if (err == 0) {
  386. de->inode = inode->i_ino;
  387. err = dir_commit_chunk(page, from, to);
  388. } else {
  389. unlock_page(page);
  390. }
  391. dir_put_page(page);
  392. dir->i_mtime = dir->i_ctime = CURRENT_TIME_SEC;
  393. mark_inode_dirty(dir);
  394. }
  395. struct minix_dir_entry * minix_dotdot (struct inode *dir, struct page **p)
  396. {
  397. struct page *page = dir_get_page(dir, 0);
  398. struct minix_sb_info *sbi = minix_sb(dir->i_sb);
  399. struct minix_dir_entry *de = NULL;
  400. if (!IS_ERR(page)) {
  401. de = minix_next_entry(page_address(page), sbi);
  402. *p = page;
  403. }
  404. return de;
  405. }
  406. ino_t minix_inode_by_name(struct dentry *dentry)
  407. {
  408. struct page *page;
  409. struct minix_dir_entry *de = minix_find_entry(dentry, &page);
  410. ino_t res = 0;
  411. if (de) {
  412. res = de->inode;
  413. dir_put_page(page);
  414. }
  415. return res;
  416. }