export.c 4.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164
  1. /*
  2. * Squashfs - a compressed read only filesystem for Linux
  3. *
  4. * Copyright (c) 2002, 2003, 2004, 2005, 2006, 2007, 2008
  5. * Phillip Lougher <phillip@squashfs.org.uk>
  6. *
  7. * This program is free software; you can redistribute it and/or
  8. * modify it under the terms of the GNU General Public License
  9. * as published by the Free Software Foundation; either version 2,
  10. * or (at your option) any later version.
  11. *
  12. * This program is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  15. * GNU General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU General Public License
  18. * along with this program; if not, write to the Free Software
  19. * Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
  20. *
  21. * export.c
  22. */
  23. /*
  24. * This file implements code to make Squashfs filesystems exportable (NFS etc.)
  25. *
  26. * The export code uses an inode lookup table to map inode numbers passed in
  27. * filehandles to an inode location on disk. This table is stored compressed
  28. * into metadata blocks. A second index table is used to locate these. This
  29. * second index table for speed of access (and because it is small) is read at
  30. * mount time and cached in memory.
  31. *
  32. * The inode lookup table is used only by the export code, inode disk
  33. * locations are directly encoded in directories, enabling direct access
  34. * without an intermediate lookup for all operations except the export ops.
  35. */
  36. #include <linux/fs.h>
  37. #include <linux/vfs.h>
  38. #include <linux/dcache.h>
  39. #include <linux/exportfs.h>
  40. #include <linux/slab.h>
  41. #include "squashfs_fs.h"
  42. #include "squashfs_fs_sb.h"
  43. #include "squashfs_fs_i.h"
  44. #include "squashfs.h"
  45. /*
  46. * Look-up inode number (ino) in table, returning the inode location.
  47. */
  48. static long long squashfs_inode_lookup(struct super_block *sb, int ino_num)
  49. {
  50. struct squashfs_sb_info *msblk = sb->s_fs_info;
  51. int blk = SQUASHFS_LOOKUP_BLOCK(ino_num - 1);
  52. int offset = SQUASHFS_LOOKUP_BLOCK_OFFSET(ino_num - 1);
  53. u64 start = le64_to_cpu(msblk->inode_lookup_table[blk]);
  54. __le64 ino;
  55. int err;
  56. TRACE("Entered squashfs_inode_lookup, inode_number = %d\n", ino_num);
  57. err = squashfs_read_metadata(sb, &ino, &start, &offset, sizeof(ino));
  58. if (err < 0)
  59. return err;
  60. TRACE("squashfs_inode_lookup, inode = 0x%llx\n",
  61. (u64) le64_to_cpu(ino));
  62. return le64_to_cpu(ino);
  63. }
  64. static struct dentry *squashfs_export_iget(struct super_block *sb,
  65. unsigned int ino_num)
  66. {
  67. long long ino;
  68. struct dentry *dentry = ERR_PTR(-ENOENT);
  69. TRACE("Entered squashfs_export_iget\n");
  70. ino = squashfs_inode_lookup(sb, ino_num);
  71. if (ino >= 0)
  72. dentry = d_obtain_alias(squashfs_iget(sb, ino, ino_num));
  73. return dentry;
  74. }
  75. static struct dentry *squashfs_fh_to_dentry(struct super_block *sb,
  76. struct fid *fid, int fh_len, int fh_type)
  77. {
  78. if ((fh_type != FILEID_INO32_GEN && fh_type != FILEID_INO32_GEN_PARENT)
  79. || fh_len < 2)
  80. return NULL;
  81. return squashfs_export_iget(sb, fid->i32.ino);
  82. }
  83. static struct dentry *squashfs_fh_to_parent(struct super_block *sb,
  84. struct fid *fid, int fh_len, int fh_type)
  85. {
  86. if (fh_type != FILEID_INO32_GEN_PARENT || fh_len < 4)
  87. return NULL;
  88. return squashfs_export_iget(sb, fid->i32.parent_ino);
  89. }
  90. static struct dentry *squashfs_get_parent(struct dentry *child)
  91. {
  92. struct inode *inode = d_inode(child);
  93. unsigned int parent_ino = squashfs_i(inode)->parent;
  94. return squashfs_export_iget(inode->i_sb, parent_ino);
  95. }
  96. /*
  97. * Read uncompressed inode lookup table indexes off disk into memory
  98. */
  99. __le64 *squashfs_read_inode_lookup_table(struct super_block *sb,
  100. u64 lookup_table_start, u64 next_table, unsigned int inodes)
  101. {
  102. unsigned int length = SQUASHFS_LOOKUP_BLOCK_BYTES(inodes);
  103. __le64 *table;
  104. TRACE("In read_inode_lookup_table, length %d\n", length);
  105. /* Sanity check values */
  106. /* there should always be at least one inode */
  107. if (inodes == 0)
  108. return ERR_PTR(-EINVAL);
  109. /* length bytes should not extend into the next table - this check
  110. * also traps instances where lookup_table_start is incorrectly larger
  111. * than the next table start
  112. */
  113. if (lookup_table_start + length > next_table)
  114. return ERR_PTR(-EINVAL);
  115. table = squashfs_read_table(sb, lookup_table_start, length);
  116. /*
  117. * table[0] points to the first inode lookup table metadata block,
  118. * this should be less than lookup_table_start
  119. */
  120. if (!IS_ERR(table) && le64_to_cpu(table[0]) >= lookup_table_start) {
  121. kfree(table);
  122. return ERR_PTR(-EINVAL);
  123. }
  124. return table;
  125. }
  126. const struct export_operations squashfs_export_ops = {
  127. .fh_to_dentry = squashfs_fh_to_dentry,
  128. .fh_to_parent = squashfs_fh_to_parent,
  129. .get_parent = squashfs_get_parent
  130. };