fragment.c 3.0 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@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. * 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 <linux/zlib.h>
  38. #include "squashfs_fs.h"
  39. #include "squashfs_fs_sb.h"
  40. #include "squashfs_fs_i.h"
  41. #include "squashfs.h"
  42. /*
  43. * Look-up fragment using the fragment index table. Return the on disk
  44. * location of the fragment and its compressed size
  45. */
  46. int squashfs_frag_lookup(struct super_block *sb, unsigned int fragment,
  47. u64 *fragment_block)
  48. {
  49. struct squashfs_sb_info *msblk = sb->s_fs_info;
  50. int block = SQUASHFS_FRAGMENT_INDEX(fragment);
  51. int offset = SQUASHFS_FRAGMENT_INDEX_OFFSET(fragment);
  52. u64 start_block = le64_to_cpu(msblk->fragment_index[block]);
  53. struct squashfs_fragment_entry fragment_entry;
  54. int size;
  55. size = squashfs_read_metadata(sb, &fragment_entry, &start_block,
  56. &offset, sizeof(fragment_entry));
  57. if (size < 0)
  58. return size;
  59. *fragment_block = le64_to_cpu(fragment_entry.start_block);
  60. size = le32_to_cpu(fragment_entry.size);
  61. return size;
  62. }
  63. /*
  64. * Read the uncompressed fragment lookup table indexes off disk into memory
  65. */
  66. __le64 *squashfs_read_fragment_index_table(struct super_block *sb,
  67. u64 fragment_table_start, unsigned int fragments)
  68. {
  69. unsigned int length = SQUASHFS_FRAGMENT_INDEX_BYTES(fragments);
  70. __le64 *fragment_index;
  71. int err;
  72. /* Allocate fragment lookup table indexes */
  73. fragment_index = kmalloc(length, GFP_KERNEL);
  74. if (fragment_index == NULL) {
  75. ERROR("Failed to allocate fragment index table\n");
  76. return ERR_PTR(-ENOMEM);
  77. }
  78. err = squashfs_read_table(sb, fragment_index, fragment_table_start,
  79. length);
  80. if (err < 0) {
  81. ERROR("unable to read fragment index table\n");
  82. kfree(fragment_index);
  83. return ERR_PTR(err);
  84. }
  85. return fragment_index;
  86. }