dir.c 9.6 KB

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