namei.c 2.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125
  1. /*
  2. * namei.c
  3. *
  4. * Copyright (c) 1999 Al Smith
  5. *
  6. * Portions derived from work (c) 1995,1996 Christian Vogelgsang.
  7. */
  8. #include <linux/buffer_head.h>
  9. #include <linux/string.h>
  10. #include <linux/smp_lock.h>
  11. #include <linux/exportfs.h>
  12. #include "efs.h"
  13. static efs_ino_t efs_find_entry(struct inode *inode, const char *name, int len) {
  14. struct buffer_head *bh;
  15. int slot, namelen;
  16. char *nameptr;
  17. struct efs_dir *dirblock;
  18. struct efs_dentry *dirslot;
  19. efs_ino_t inodenum;
  20. efs_block_t block;
  21. if (inode->i_size & (EFS_DIRBSIZE-1))
  22. printk(KERN_WARNING "EFS: WARNING: find_entry(): directory size not a multiple of EFS_DIRBSIZE\n");
  23. for(block = 0; block < inode->i_blocks; block++) {
  24. bh = sb_bread(inode->i_sb, efs_bmap(inode, block));
  25. if (!bh) {
  26. printk(KERN_ERR "EFS: find_entry(): failed to read dir block %d\n", block);
  27. return 0;
  28. }
  29. dirblock = (struct efs_dir *) bh->b_data;
  30. if (be16_to_cpu(dirblock->magic) != EFS_DIRBLK_MAGIC) {
  31. printk(KERN_ERR "EFS: find_entry(): invalid directory block\n");
  32. brelse(bh);
  33. return(0);
  34. }
  35. for(slot = 0; slot < dirblock->slots; slot++) {
  36. dirslot = (struct efs_dentry *) (((char *) bh->b_data) + EFS_SLOTAT(dirblock, slot));
  37. namelen = dirslot->namelen;
  38. nameptr = dirslot->name;
  39. if ((namelen == len) && (!memcmp(name, nameptr, len))) {
  40. inodenum = be32_to_cpu(dirslot->inode);
  41. brelse(bh);
  42. return(inodenum);
  43. }
  44. }
  45. brelse(bh);
  46. }
  47. return(0);
  48. }
  49. struct dentry *efs_lookup(struct inode *dir, struct dentry *dentry, struct nameidata *nd) {
  50. efs_ino_t inodenum;
  51. struct inode * inode = NULL;
  52. lock_kernel();
  53. inodenum = efs_find_entry(dir, dentry->d_name.name, dentry->d_name.len);
  54. if (inodenum) {
  55. inode = efs_iget(dir->i_sb, inodenum);
  56. if (IS_ERR(inode)) {
  57. unlock_kernel();
  58. return ERR_CAST(inode);
  59. }
  60. }
  61. unlock_kernel();
  62. return d_splice_alias(inode, dentry);
  63. }
  64. static struct inode *efs_nfs_get_inode(struct super_block *sb, u64 ino,
  65. u32 generation)
  66. {
  67. struct inode *inode;
  68. if (ino == 0)
  69. return ERR_PTR(-ESTALE);
  70. inode = efs_iget(sb, ino);
  71. if (IS_ERR(inode))
  72. return ERR_CAST(inode);
  73. if (generation && inode->i_generation != generation) {
  74. iput(inode);
  75. return ERR_PTR(-ESTALE);
  76. }
  77. return inode;
  78. }
  79. struct dentry *efs_fh_to_dentry(struct super_block *sb, struct fid *fid,
  80. int fh_len, int fh_type)
  81. {
  82. return generic_fh_to_dentry(sb, fid, fh_len, fh_type,
  83. efs_nfs_get_inode);
  84. }
  85. struct dentry *efs_fh_to_parent(struct super_block *sb, struct fid *fid,
  86. int fh_len, int fh_type)
  87. {
  88. return generic_fh_to_parent(sb, fid, fh_len, fh_type,
  89. efs_nfs_get_inode);
  90. }
  91. struct dentry *efs_get_parent(struct dentry *child)
  92. {
  93. struct dentry *parent = ERR_PTR(-ENOENT);
  94. efs_ino_t ino;
  95. lock_kernel();
  96. ino = efs_find_entry(child->d_inode, "..", 2);
  97. if (ino)
  98. parent = d_obtain_alias(efs_iget(child->d_inode->i_sb, ino));
  99. unlock_kernel();
  100. return parent;
  101. }