id.c 2.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102
  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. * id.c
  22. */
  23. /*
  24. * This file implements code to handle uids and gids.
  25. *
  26. * For space efficiency regular files store uid and gid indexes, which are
  27. * converted to 32-bit uids/gids using an id look up table. This table is
  28. * stored compressed into metadata blocks. A second index table is used to
  29. * locate these. This second index table for speed of access (and because it
  30. * is small) is read at mount time and cached in memory.
  31. */
  32. #include <linux/fs.h>
  33. #include <linux/vfs.h>
  34. #include <linux/slab.h>
  35. #include "squashfs_fs.h"
  36. #include "squashfs_fs_sb.h"
  37. #include "squashfs.h"
  38. /*
  39. * Map uid/gid index into real 32-bit uid/gid using the id look up table
  40. */
  41. int squashfs_get_id(struct super_block *sb, unsigned int index,
  42. unsigned int *id)
  43. {
  44. struct squashfs_sb_info *msblk = sb->s_fs_info;
  45. int block = SQUASHFS_ID_BLOCK(index);
  46. int offset = SQUASHFS_ID_BLOCK_OFFSET(index);
  47. u64 start_block = le64_to_cpu(msblk->id_table[block]);
  48. __le32 disk_id;
  49. int err;
  50. err = squashfs_read_metadata(sb, &disk_id, &start_block, &offset,
  51. sizeof(disk_id));
  52. if (err < 0)
  53. return err;
  54. *id = le32_to_cpu(disk_id);
  55. return 0;
  56. }
  57. /*
  58. * Read uncompressed id lookup table indexes from disk into memory
  59. */
  60. __le64 *squashfs_read_id_index_table(struct super_block *sb,
  61. u64 id_table_start, u64 next_table, unsigned short no_ids)
  62. {
  63. unsigned int length = SQUASHFS_ID_BLOCK_BYTES(no_ids);
  64. __le64 *table;
  65. TRACE("In read_id_index_table, length %d\n", length);
  66. /* Sanity check values */
  67. /* there should always be at least one id */
  68. if (no_ids == 0)
  69. return ERR_PTR(-EINVAL);
  70. /*
  71. * length bytes should not extend into the next table - this check
  72. * also traps instances where id_table_start is incorrectly larger
  73. * than the next table start
  74. */
  75. if (id_table_start + length > next_table)
  76. return ERR_PTR(-EINVAL);
  77. table = squashfs_read_table(sb, id_table_start, length);
  78. /*
  79. * table[0] points to the first id lookup table metadata block, this
  80. * should be less than id_table_start
  81. */
  82. if (!IS_ERR(table) && le64_to_cpu(table[0]) >= id_table_start) {
  83. kfree(table);
  84. return ERR_PTR(-EINVAL);
  85. }
  86. return table;
  87. }