fragment.c 3.1 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798
  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. * fragment.c
  22. */
  23. /*
  24. * This file implements code to handle compressed fragments (tail-end packed
  25. * datablocks).
  26. *
  27. * Regular files contain a fragment index which is mapped to a fragment
  28. * location on disk and compressed size using a fragment lookup table.
  29. * Like everything in Squashfs this fragment lookup table is itself stored
  30. * compressed into metadata blocks. A second index table is used to locate
  31. * these. This second index table for speed of access (and because it
  32. * is small) is read at mount time and cached in memory.
  33. */
  34. #include <linux/fs.h>
  35. #include <linux/vfs.h>
  36. #include <linux/slab.h>
  37. #include "squashfs_fs.h"
  38. #include "squashfs_fs_sb.h"
  39. #include "squashfs.h"
  40. /*
  41. * Look-up fragment using the fragment index table. Return the on disk
  42. * location of the fragment and its compressed size
  43. */
  44. int squashfs_frag_lookup(struct super_block *sb, unsigned int fragment,
  45. u64 *fragment_block)
  46. {
  47. struct squashfs_sb_info *msblk = sb->s_fs_info;
  48. int block = SQUASHFS_FRAGMENT_INDEX(fragment);
  49. int offset = SQUASHFS_FRAGMENT_INDEX_OFFSET(fragment);
  50. u64 start_block = le64_to_cpu(msblk->fragment_index[block]);
  51. struct squashfs_fragment_entry fragment_entry;
  52. int size;
  53. size = squashfs_read_metadata(sb, &fragment_entry, &start_block,
  54. &offset, sizeof(fragment_entry));
  55. if (size < 0)
  56. return size;
  57. *fragment_block = le64_to_cpu(fragment_entry.start_block);
  58. return squashfs_block_size(fragment_entry.size);
  59. }
  60. /*
  61. * Read the uncompressed fragment lookup table indexes off disk into memory
  62. */
  63. __le64 *squashfs_read_fragment_index_table(struct super_block *sb,
  64. u64 fragment_table_start, u64 next_table, unsigned int fragments)
  65. {
  66. unsigned int length = SQUASHFS_FRAGMENT_INDEX_BYTES(fragments);
  67. __le64 *table;
  68. /*
  69. * Sanity check, length bytes should not extend into the next table -
  70. * this check also traps instances where fragment_table_start is
  71. * incorrectly larger than the next table start
  72. */
  73. if (fragment_table_start + length > next_table)
  74. return ERR_PTR(-EINVAL);
  75. table = squashfs_read_table(sb, fragment_table_start, length);
  76. /*
  77. * table[0] points to the first fragment table metadata block, this
  78. * should be less than fragment_table_start
  79. */
  80. if (!IS_ERR(table) && le64_to_cpu(table[0]) >= fragment_table_start) {
  81. kfree(table);
  82. return ERR_PTR(-EINVAL);
  83. }
  84. return table;
  85. }