id.c 2.7 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394
  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@lougher.demon.co.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 <linux/zlib.h>
  36. #include "squashfs_fs.h"
  37. #include "squashfs_fs_sb.h"
  38. #include "squashfs_fs_i.h"
  39. #include "squashfs.h"
  40. /*
  41. * Map uid/gid index into real 32-bit uid/gid using the id look up table
  42. */
  43. int squashfs_get_id(struct super_block *sb, unsigned int index,
  44. unsigned int *id)
  45. {
  46. struct squashfs_sb_info *msblk = sb->s_fs_info;
  47. int block = SQUASHFS_ID_BLOCK(index);
  48. int offset = SQUASHFS_ID_BLOCK_OFFSET(index);
  49. u64 start_block = le64_to_cpu(msblk->id_table[block]);
  50. __le32 disk_id;
  51. int err;
  52. err = squashfs_read_metadata(sb, &disk_id, &start_block, &offset,
  53. sizeof(disk_id));
  54. if (err < 0)
  55. return err;
  56. *id = le32_to_cpu(disk_id);
  57. return 0;
  58. }
  59. /*
  60. * Read uncompressed id lookup table indexes from disk into memory
  61. */
  62. __le64 *squashfs_read_id_index_table(struct super_block *sb,
  63. u64 id_table_start, unsigned short no_ids)
  64. {
  65. unsigned int length = SQUASHFS_ID_BLOCK_BYTES(no_ids);
  66. __le64 *id_table;
  67. int err;
  68. TRACE("In read_id_index_table, length %d\n", length);
  69. /* Allocate id lookup table indexes */
  70. id_table = kmalloc(length, GFP_KERNEL);
  71. if (id_table == NULL) {
  72. ERROR("Failed to allocate id index table\n");
  73. return ERR_PTR(-ENOMEM);
  74. }
  75. err = squashfs_read_table(sb, id_table, id_table_start, length);
  76. if (err < 0) {
  77. ERROR("unable to read id index table\n");
  78. kfree(id_table);
  79. return ERR_PTR(err);
  80. }
  81. return id_table;
  82. }