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