dir.c 16 KB

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