dir.c 9.6 KB

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