dir.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645
  1. /*
  2. * Directory operations for Coda filesystem
  3. * Original version: (C) 1996 P. Braam and M. Callahan
  4. * Rewritten for Linux 2.1. (C) 1997 Carnegie Mellon University
  5. *
  6. * Carnegie Mellon encourages users to contribute improvements to
  7. * the Coda project. Contact Peter Braam (coda@cs.cmu.edu).
  8. */
  9. #include <linux/types.h>
  10. #include <linux/kernel.h>
  11. #include <linux/time.h>
  12. #include <linux/fs.h>
  13. #include <linux/slab.h>
  14. #include <linux/file.h>
  15. #include <linux/stat.h>
  16. #include <linux/errno.h>
  17. #include <linux/string.h>
  18. #include <linux/spinlock.h>
  19. #include <asm/uaccess.h>
  20. #include <linux/coda.h>
  21. #include <linux/coda_linux.h>
  22. #include <linux/coda_psdev.h>
  23. #include <linux/coda_fs_i.h>
  24. #include <linux/coda_cache.h>
  25. #include "coda_int.h"
  26. /* dir inode-ops */
  27. static int coda_create(struct inode *dir, struct dentry *new, int mode, struct nameidata *nd);
  28. static struct dentry *coda_lookup(struct inode *dir, struct dentry *target, struct nameidata *nd);
  29. static int coda_link(struct dentry *old_dentry, struct inode *dir_inode,
  30. struct dentry *entry);
  31. static int coda_unlink(struct inode *dir_inode, struct dentry *entry);
  32. static int coda_symlink(struct inode *dir_inode, struct dentry *entry,
  33. const char *symname);
  34. static int coda_mkdir(struct inode *dir_inode, struct dentry *entry, int mode);
  35. static int coda_rmdir(struct inode *dir_inode, struct dentry *entry);
  36. static int coda_rename(struct inode *old_inode, struct dentry *old_dentry,
  37. struct inode *new_inode, struct dentry *new_dentry);
  38. /* dir file-ops */
  39. static int coda_readdir(struct file *file, void *buf, filldir_t filldir);
  40. /* dentry ops */
  41. static int coda_dentry_revalidate(struct dentry *de, struct nameidata *nd);
  42. static int coda_dentry_delete(struct dentry *);
  43. /* support routines */
  44. static int coda_venus_readdir(struct file *coda_file, void *buf,
  45. filldir_t filldir);
  46. /* same as fs/bad_inode.c */
  47. static int coda_return_EIO(void)
  48. {
  49. return -EIO;
  50. }
  51. #define CODA_EIO_ERROR ((void *) (coda_return_EIO))
  52. static const struct dentry_operations coda_dentry_operations =
  53. {
  54. .d_revalidate = coda_dentry_revalidate,
  55. .d_delete = coda_dentry_delete,
  56. };
  57. const struct inode_operations coda_dir_inode_operations =
  58. {
  59. .create = coda_create,
  60. .lookup = coda_lookup,
  61. .link = coda_link,
  62. .unlink = coda_unlink,
  63. .symlink = coda_symlink,
  64. .mkdir = coda_mkdir,
  65. .rmdir = coda_rmdir,
  66. .mknod = CODA_EIO_ERROR,
  67. .rename = coda_rename,
  68. .permission = coda_permission,
  69. .getattr = coda_getattr,
  70. .setattr = coda_setattr,
  71. };
  72. const struct file_operations coda_dir_operations = {
  73. .llseek = generic_file_llseek,
  74. .read = generic_read_dir,
  75. .readdir = coda_readdir,
  76. .open = coda_open,
  77. .release = coda_release,
  78. .fsync = coda_fsync,
  79. };
  80. /* inode operations for directories */
  81. /* access routines: lookup, readlink, permission */
  82. static struct dentry *coda_lookup(struct inode *dir, struct dentry *entry, struct nameidata *nd)
  83. {
  84. struct inode *inode = NULL;
  85. struct CodaFid resfid = { { 0, } };
  86. int type = 0;
  87. int error = 0;
  88. const char *name = entry->d_name.name;
  89. size_t length = entry->d_name.len;
  90. if (length > CODA_MAXNAMLEN) {
  91. printk(KERN_ERR "name too long: lookup, %s (%*s)\n",
  92. coda_i2s(dir), (int)length, name);
  93. return ERR_PTR(-ENAMETOOLONG);
  94. }
  95. /* control object, create inode on the fly */
  96. if (coda_isroot(dir) && coda_iscontrol(name, length)) {
  97. error = coda_cnode_makectl(&inode, dir->i_sb);
  98. type = CODA_NOCACHE;
  99. goto exit;
  100. }
  101. error = venus_lookup(dir->i_sb, coda_i2f(dir), name, length,
  102. &type, &resfid);
  103. if (!error)
  104. error = coda_cnode_make(&inode, &resfid, dir->i_sb);
  105. if (error && error != -ENOENT)
  106. return ERR_PTR(error);
  107. exit:
  108. entry->d_op = &coda_dentry_operations;
  109. if (inode && (type & CODA_NOCACHE))
  110. coda_flag_inode(inode, C_VATTR | C_PURGE);
  111. return d_splice_alias(inode, entry);
  112. }
  113. int coda_permission(struct inode *inode, int mask)
  114. {
  115. int error;
  116. mask &= MAY_READ | MAY_WRITE | MAY_EXEC;
  117. if (!mask)
  118. return 0;
  119. if ((mask & MAY_EXEC) && !execute_ok(inode))
  120. return -EACCES;
  121. if (coda_cache_check(inode, mask))
  122. return 0;
  123. error = venus_access(inode->i_sb, coda_i2f(inode), mask);
  124. if (!error)
  125. coda_cache_enter(inode, mask);
  126. return error;
  127. }
  128. static inline void coda_dir_update_mtime(struct inode *dir)
  129. {
  130. #ifdef REQUERY_VENUS_FOR_MTIME
  131. /* invalidate the directory cnode's attributes so we refetch the
  132. * attributes from venus next time the inode is referenced */
  133. coda_flag_inode(dir, C_VATTR);
  134. #else
  135. /* optimistically we can also act as if our nose bleeds. The
  136. * granularity of the mtime is coarse anyways so we might actually be
  137. * right most of the time. Note: we only do this for directories. */
  138. dir->i_mtime = dir->i_ctime = CURRENT_TIME_SEC;
  139. #endif
  140. }
  141. /* we have to wrap inc_nlink/drop_nlink because sometimes userspace uses a
  142. * trick to fool GNU find's optimizations. If we can't be sure of the link
  143. * (because of volume mount points) we set i_nlink to 1 which forces find
  144. * to consider every child as a possible directory. We should also never
  145. * see an increment or decrement for deleted directories where i_nlink == 0 */
  146. static inline void coda_dir_inc_nlink(struct inode *dir)
  147. {
  148. if (dir->i_nlink >= 2)
  149. inc_nlink(dir);
  150. }
  151. static inline void coda_dir_drop_nlink(struct inode *dir)
  152. {
  153. if (dir->i_nlink > 2)
  154. drop_nlink(dir);
  155. }
  156. /* creation routines: create, mknod, mkdir, link, symlink */
  157. static int coda_create(struct inode *dir, struct dentry *de, int mode, struct nameidata *nd)
  158. {
  159. int error;
  160. const char *name=de->d_name.name;
  161. int length=de->d_name.len;
  162. struct inode *inode;
  163. struct CodaFid newfid;
  164. struct coda_vattr attrs;
  165. if (coda_isroot(dir) && coda_iscontrol(name, length))
  166. return -EPERM;
  167. error = venus_create(dir->i_sb, coda_i2f(dir), name, length,
  168. 0, mode, &newfid, &attrs);
  169. if (error)
  170. goto err_out;
  171. inode = coda_iget(dir->i_sb, &newfid, &attrs);
  172. if (IS_ERR(inode)) {
  173. error = PTR_ERR(inode);
  174. goto err_out;
  175. }
  176. /* invalidate the directory cnode's attributes */
  177. coda_dir_update_mtime(dir);
  178. d_instantiate(de, inode);
  179. return 0;
  180. err_out:
  181. d_drop(de);
  182. return error;
  183. }
  184. static int coda_mkdir(struct inode *dir, struct dentry *de, int mode)
  185. {
  186. struct inode *inode;
  187. struct coda_vattr attrs;
  188. const char *name = de->d_name.name;
  189. int len = de->d_name.len;
  190. int error;
  191. struct CodaFid newfid;
  192. if (coda_isroot(dir) && coda_iscontrol(name, len))
  193. return -EPERM;
  194. attrs.va_mode = mode;
  195. error = venus_mkdir(dir->i_sb, coda_i2f(dir),
  196. name, len, &newfid, &attrs);
  197. if (error)
  198. goto err_out;
  199. inode = coda_iget(dir->i_sb, &newfid, &attrs);
  200. if (IS_ERR(inode)) {
  201. error = PTR_ERR(inode);
  202. goto err_out;
  203. }
  204. /* invalidate the directory cnode's attributes */
  205. coda_dir_inc_nlink(dir);
  206. coda_dir_update_mtime(dir);
  207. d_instantiate(de, inode);
  208. return 0;
  209. err_out:
  210. d_drop(de);
  211. return error;
  212. }
  213. /* try to make de an entry in dir_inodde linked to source_de */
  214. static int coda_link(struct dentry *source_de, struct inode *dir_inode,
  215. struct dentry *de)
  216. {
  217. struct inode *inode = source_de->d_inode;
  218. const char * name = de->d_name.name;
  219. int len = de->d_name.len;
  220. int error;
  221. if (coda_isroot(dir_inode) && coda_iscontrol(name, len))
  222. return -EPERM;
  223. error = venus_link(dir_inode->i_sb, coda_i2f(inode),
  224. coda_i2f(dir_inode), (const char *)name, len);
  225. if (error) {
  226. d_drop(de);
  227. return error;
  228. }
  229. coda_dir_update_mtime(dir_inode);
  230. ihold(inode);
  231. d_instantiate(de, inode);
  232. inc_nlink(inode);
  233. return 0;
  234. }
  235. static int coda_symlink(struct inode *dir_inode, struct dentry *de,
  236. const char *symname)
  237. {
  238. const char *name = de->d_name.name;
  239. int len = de->d_name.len;
  240. int symlen;
  241. int error;
  242. if (coda_isroot(dir_inode) && coda_iscontrol(name, len))
  243. return -EPERM;
  244. symlen = strlen(symname);
  245. if (symlen > CODA_MAXPATHLEN)
  246. return -ENAMETOOLONG;
  247. /*
  248. * This entry is now negative. Since we do not create
  249. * an inode for the entry we have to drop it.
  250. */
  251. d_drop(de);
  252. error = venus_symlink(dir_inode->i_sb, coda_i2f(dir_inode), name, len,
  253. symname, symlen);
  254. /* mtime is no good anymore */
  255. if (!error)
  256. coda_dir_update_mtime(dir_inode);
  257. return error;
  258. }
  259. /* destruction routines: unlink, rmdir */
  260. static int coda_unlink(struct inode *dir, struct dentry *de)
  261. {
  262. int error;
  263. const char *name = de->d_name.name;
  264. int len = de->d_name.len;
  265. error = venus_remove(dir->i_sb, coda_i2f(dir), name, len);
  266. if (error)
  267. return error;
  268. coda_dir_update_mtime(dir);
  269. drop_nlink(de->d_inode);
  270. return 0;
  271. }
  272. static int coda_rmdir(struct inode *dir, struct dentry *de)
  273. {
  274. const char *name = de->d_name.name;
  275. int len = de->d_name.len;
  276. int error;
  277. error = venus_rmdir(dir->i_sb, coda_i2f(dir), name, len);
  278. if (!error) {
  279. /* VFS may delete the child */
  280. if (de->d_inode)
  281. de->d_inode->i_nlink = 0;
  282. /* fix the link count of the parent */
  283. coda_dir_drop_nlink(dir);
  284. coda_dir_update_mtime(dir);
  285. }
  286. return error;
  287. }
  288. /* rename */
  289. static int coda_rename(struct inode *old_dir, struct dentry *old_dentry,
  290. struct inode *new_dir, struct dentry *new_dentry)
  291. {
  292. const char *old_name = old_dentry->d_name.name;
  293. const char *new_name = new_dentry->d_name.name;
  294. int old_length = old_dentry->d_name.len;
  295. int new_length = new_dentry->d_name.len;
  296. int error;
  297. error = venus_rename(old_dir->i_sb, coda_i2f(old_dir),
  298. coda_i2f(new_dir), old_length, new_length,
  299. (const char *) old_name, (const char *)new_name);
  300. if (!error) {
  301. if (new_dentry->d_inode) {
  302. if (S_ISDIR(new_dentry->d_inode->i_mode)) {
  303. coda_dir_drop_nlink(old_dir);
  304. coda_dir_inc_nlink(new_dir);
  305. }
  306. coda_dir_update_mtime(old_dir);
  307. coda_dir_update_mtime(new_dir);
  308. coda_flag_inode(new_dentry->d_inode, C_VATTR);
  309. } else {
  310. coda_flag_inode(old_dir, C_VATTR);
  311. coda_flag_inode(new_dir, C_VATTR);
  312. }
  313. }
  314. return error;
  315. }
  316. /* file operations for directories */
  317. static int coda_readdir(struct file *coda_file, void *buf, filldir_t filldir)
  318. {
  319. struct coda_file_info *cfi;
  320. struct file *host_file;
  321. int ret;
  322. cfi = CODA_FTOC(coda_file);
  323. BUG_ON(!cfi || cfi->cfi_magic != CODA_MAGIC);
  324. host_file = cfi->cfi_container;
  325. if (!host_file->f_op)
  326. return -ENOTDIR;
  327. if (host_file->f_op->readdir)
  328. {
  329. /* potemkin case: we were handed a directory inode.
  330. * We can't use vfs_readdir because we have to keep the file
  331. * position in sync between the coda_file and the host_file.
  332. * and as such we need grab the inode mutex. */
  333. struct inode *host_inode = host_file->f_path.dentry->d_inode;
  334. mutex_lock(&host_inode->i_mutex);
  335. host_file->f_pos = coda_file->f_pos;
  336. ret = -ENOENT;
  337. if (!IS_DEADDIR(host_inode)) {
  338. ret = host_file->f_op->readdir(host_file, buf, filldir);
  339. file_accessed(host_file);
  340. }
  341. coda_file->f_pos = host_file->f_pos;
  342. mutex_unlock(&host_inode->i_mutex);
  343. }
  344. else /* Venus: we must read Venus dirents from a file */
  345. ret = coda_venus_readdir(coda_file, buf, filldir);
  346. return ret;
  347. }
  348. static inline unsigned int CDT2DT(unsigned char cdt)
  349. {
  350. unsigned int dt;
  351. switch(cdt) {
  352. case CDT_UNKNOWN: dt = DT_UNKNOWN; break;
  353. case CDT_FIFO: dt = DT_FIFO; break;
  354. case CDT_CHR: dt = DT_CHR; break;
  355. case CDT_DIR: dt = DT_DIR; break;
  356. case CDT_BLK: dt = DT_BLK; break;
  357. case CDT_REG: dt = DT_REG; break;
  358. case CDT_LNK: dt = DT_LNK; break;
  359. case CDT_SOCK: dt = DT_SOCK; break;
  360. case CDT_WHT: dt = DT_WHT; break;
  361. default: dt = DT_UNKNOWN; break;
  362. }
  363. return dt;
  364. }
  365. /* support routines */
  366. static int coda_venus_readdir(struct file *coda_file, void *buf,
  367. filldir_t filldir)
  368. {
  369. int result = 0; /* # of entries returned */
  370. struct coda_file_info *cfi;
  371. struct coda_inode_info *cii;
  372. struct file *host_file;
  373. struct dentry *de;
  374. struct venus_dirent *vdir;
  375. unsigned long vdir_size =
  376. (unsigned long)(&((struct venus_dirent *)0)->d_name);
  377. unsigned int type;
  378. struct qstr name;
  379. ino_t ino;
  380. int ret;
  381. cfi = CODA_FTOC(coda_file);
  382. BUG_ON(!cfi || cfi->cfi_magic != CODA_MAGIC);
  383. host_file = cfi->cfi_container;
  384. de = coda_file->f_path.dentry;
  385. cii = ITOC(de->d_inode);
  386. vdir = kmalloc(sizeof(*vdir), GFP_KERNEL);
  387. if (!vdir) return -ENOMEM;
  388. if (coda_file->f_pos == 0) {
  389. ret = filldir(buf, ".", 1, 0, de->d_inode->i_ino, DT_DIR);
  390. if (ret < 0)
  391. goto out;
  392. result++;
  393. coda_file->f_pos++;
  394. }
  395. if (coda_file->f_pos == 1) {
  396. ret = filldir(buf, "..", 2, 1, de->d_parent->d_inode->i_ino, DT_DIR);
  397. if (ret < 0)
  398. goto out;
  399. result++;
  400. coda_file->f_pos++;
  401. }
  402. while (1) {
  403. /* read entries from the directory file */
  404. ret = kernel_read(host_file, coda_file->f_pos - 2, (char *)vdir,
  405. sizeof(*vdir));
  406. if (ret < 0) {
  407. printk(KERN_ERR "coda readdir: read dir %s failed %d\n",
  408. coda_f2s(&cii->c_fid), ret);
  409. break;
  410. }
  411. if (ret == 0) break; /* end of directory file reached */
  412. /* catch truncated reads */
  413. if (ret < vdir_size || ret < vdir_size + vdir->d_namlen) {
  414. printk(KERN_ERR "coda readdir: short read on %s\n",
  415. coda_f2s(&cii->c_fid));
  416. ret = -EBADF;
  417. break;
  418. }
  419. /* validate whether the directory file actually makes sense */
  420. if (vdir->d_reclen < vdir_size + vdir->d_namlen) {
  421. printk(KERN_ERR "coda readdir: invalid dir %s\n",
  422. coda_f2s(&cii->c_fid));
  423. ret = -EBADF;
  424. break;
  425. }
  426. name.len = vdir->d_namlen;
  427. name.name = vdir->d_name;
  428. /* Make sure we skip '.' and '..', we already got those */
  429. if (name.name[0] == '.' && (name.len == 1 ||
  430. (vdir->d_name[1] == '.' && name.len == 2)))
  431. vdir->d_fileno = name.len = 0;
  432. /* skip null entries */
  433. if (vdir->d_fileno && name.len) {
  434. /* try to look up this entry in the dcache, that way
  435. * userspace doesn't have to worry about breaking
  436. * getcwd by having mismatched inode numbers for
  437. * internal volume mountpoints. */
  438. ino = find_inode_number(de, &name);
  439. if (!ino) ino = vdir->d_fileno;
  440. type = CDT2DT(vdir->d_type);
  441. ret = filldir(buf, name.name, name.len,
  442. coda_file->f_pos, ino, type);
  443. /* failure means no space for filling in this round */
  444. if (ret < 0) break;
  445. result++;
  446. }
  447. /* we'll always have progress because d_reclen is unsigned and
  448. * we've already established it is non-zero. */
  449. coda_file->f_pos += vdir->d_reclen;
  450. }
  451. out:
  452. kfree(vdir);
  453. return result ? result : ret;
  454. }
  455. /* called when a cache lookup succeeds */
  456. static int coda_dentry_revalidate(struct dentry *de, struct nameidata *nd)
  457. {
  458. struct inode *inode = de->d_inode;
  459. struct coda_inode_info *cii;
  460. if (!inode || coda_isroot(inode))
  461. goto out;
  462. if (is_bad_inode(inode))
  463. goto bad;
  464. cii = ITOC(de->d_inode);
  465. if (!(cii->c_flags & (C_PURGE | C_FLUSH)))
  466. goto out;
  467. shrink_dcache_parent(de);
  468. /* propagate for a flush */
  469. if (cii->c_flags & C_FLUSH)
  470. coda_flag_inode_children(inode, C_FLUSH);
  471. if (atomic_read(&de->d_count) > 1)
  472. /* pretend it's valid, but don't change the flags */
  473. goto out;
  474. /* clear the flags. */
  475. spin_lock(&cii->c_lock);
  476. cii->c_flags &= ~(C_VATTR | C_PURGE | C_FLUSH);
  477. spin_unlock(&cii->c_lock);
  478. bad:
  479. return 0;
  480. out:
  481. return 1;
  482. }
  483. /*
  484. * This is the callback from dput() when d_count is going to 0.
  485. * We use this to unhash dentries with bad inodes.
  486. */
  487. static int coda_dentry_delete(struct dentry * dentry)
  488. {
  489. int flags;
  490. if (!dentry->d_inode)
  491. return 0;
  492. flags = (ITOC(dentry->d_inode)->c_flags) & C_PURGE;
  493. if (is_bad_inode(dentry->d_inode) || flags) {
  494. return 1;
  495. }
  496. return 0;
  497. }
  498. /*
  499. * This is called when we want to check if the inode has
  500. * changed on the server. Coda makes this easy since the
  501. * cache manager Venus issues a downcall to the kernel when this
  502. * happens
  503. */
  504. int coda_revalidate_inode(struct dentry *dentry)
  505. {
  506. struct coda_vattr attr;
  507. int error;
  508. int old_mode;
  509. ino_t old_ino;
  510. struct inode *inode = dentry->d_inode;
  511. struct coda_inode_info *cii = ITOC(inode);
  512. if (!cii->c_flags)
  513. return 0;
  514. if (cii->c_flags & (C_VATTR | C_PURGE | C_FLUSH)) {
  515. error = venus_getattr(inode->i_sb, &(cii->c_fid), &attr);
  516. if (error)
  517. return -EIO;
  518. /* this inode may be lost if:
  519. - it's ino changed
  520. - type changes must be permitted for repair and
  521. missing mount points.
  522. */
  523. old_mode = inode->i_mode;
  524. old_ino = inode->i_ino;
  525. coda_vattr_to_iattr(inode, &attr);
  526. if ((old_mode & S_IFMT) != (inode->i_mode & S_IFMT)) {
  527. printk("Coda: inode %ld, fid %s changed type!\n",
  528. inode->i_ino, coda_f2s(&(cii->c_fid)));
  529. }
  530. /* the following can happen when a local fid is replaced
  531. with a global one, here we lose and declare the inode bad */
  532. if (inode->i_ino != old_ino)
  533. return -EIO;
  534. coda_flag_inode_children(inode, C_FLUSH);
  535. spin_lock(&cii->c_lock);
  536. cii->c_flags &= ~(C_VATTR | C_PURGE | C_FLUSH);
  537. spin_unlock(&cii->c_lock);
  538. }
  539. return 0;
  540. }