compress.c 29 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961
  1. /**
  2. * compress.c - NTFS kernel compressed attributes handling.
  3. * Part of the Linux-NTFS project.
  4. *
  5. * Copyright (c) 2001-2004 Anton Altaparmakov
  6. * Copyright (c) 2002 Richard Russon
  7. *
  8. * This program/include file is free software; you can redistribute it and/or
  9. * modify it under the terms of the GNU General Public License as published
  10. * by the Free Software Foundation; either version 2 of the License, or
  11. * (at your option) any later version.
  12. *
  13. * This program/include file is distributed in the hope that it will be
  14. * useful, but WITHOUT ANY WARRANTY; without even the implied warranty
  15. * of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  16. * GNU General Public License for more details.
  17. *
  18. * You should have received a copy of the GNU General Public License
  19. * along with this program (in the main directory of the Linux-NTFS
  20. * distribution in the file COPYING); if not, write to the Free Software
  21. * Foundation,Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  22. */
  23. #include <linux/fs.h>
  24. #include <linux/buffer_head.h>
  25. #include <linux/blkdev.h>
  26. #include <linux/vmalloc.h>
  27. #include <linux/slab.h>
  28. #include "attrib.h"
  29. #include "inode.h"
  30. #include "debug.h"
  31. #include "ntfs.h"
  32. /**
  33. * ntfs_compression_constants - enum of constants used in the compression code
  34. */
  35. typedef enum {
  36. /* Token types and access mask. */
  37. NTFS_SYMBOL_TOKEN = 0,
  38. NTFS_PHRASE_TOKEN = 1,
  39. NTFS_TOKEN_MASK = 1,
  40. /* Compression sub-block constants. */
  41. NTFS_SB_SIZE_MASK = 0x0fff,
  42. NTFS_SB_SIZE = 0x1000,
  43. NTFS_SB_IS_COMPRESSED = 0x8000,
  44. /*
  45. * The maximum compression block size is by definition 16 * the cluster
  46. * size, with the maximum supported cluster size being 4kiB. Thus the
  47. * maximum compression buffer size is 64kiB, so we use this when
  48. * initializing the compression buffer.
  49. */
  50. NTFS_MAX_CB_SIZE = 64 * 1024,
  51. } ntfs_compression_constants;
  52. /**
  53. * ntfs_compression_buffer - one buffer for the decompression engine
  54. */
  55. static u8 *ntfs_compression_buffer;
  56. /**
  57. * ntfs_cb_lock - spinlock which protects ntfs_compression_buffer
  58. */
  59. static DEFINE_SPINLOCK(ntfs_cb_lock);
  60. /**
  61. * allocate_compression_buffers - allocate the decompression buffers
  62. *
  63. * Caller has to hold the ntfs_lock mutex.
  64. *
  65. * Return 0 on success or -ENOMEM if the allocations failed.
  66. */
  67. int allocate_compression_buffers(void)
  68. {
  69. BUG_ON(ntfs_compression_buffer);
  70. ntfs_compression_buffer = vmalloc(NTFS_MAX_CB_SIZE);
  71. if (!ntfs_compression_buffer)
  72. return -ENOMEM;
  73. return 0;
  74. }
  75. /**
  76. * free_compression_buffers - free the decompression buffers
  77. *
  78. * Caller has to hold the ntfs_lock mutex.
  79. */
  80. void free_compression_buffers(void)
  81. {
  82. BUG_ON(!ntfs_compression_buffer);
  83. vfree(ntfs_compression_buffer);
  84. ntfs_compression_buffer = NULL;
  85. }
  86. /**
  87. * zero_partial_compressed_page - zero out of bounds compressed page region
  88. */
  89. static void zero_partial_compressed_page(struct page *page,
  90. const s64 initialized_size)
  91. {
  92. u8 *kp = page_address(page);
  93. unsigned int kp_ofs;
  94. ntfs_debug("Zeroing page region outside initialized size.");
  95. if (((s64)page->index << PAGE_SHIFT) >= initialized_size) {
  96. clear_page(kp);
  97. return;
  98. }
  99. kp_ofs = initialized_size & ~PAGE_MASK;
  100. memset(kp + kp_ofs, 0, PAGE_SIZE - kp_ofs);
  101. return;
  102. }
  103. /**
  104. * handle_bounds_compressed_page - test for&handle out of bounds compressed page
  105. */
  106. static inline void handle_bounds_compressed_page(struct page *page,
  107. const loff_t i_size, const s64 initialized_size)
  108. {
  109. if ((page->index >= (initialized_size >> PAGE_SHIFT)) &&
  110. (initialized_size < i_size))
  111. zero_partial_compressed_page(page, initialized_size);
  112. return;
  113. }
  114. /**
  115. * ntfs_decompress - decompress a compression block into an array of pages
  116. * @dest_pages: destination array of pages
  117. * @dest_index: current index into @dest_pages (IN/OUT)
  118. * @dest_ofs: current offset within @dest_pages[@dest_index] (IN/OUT)
  119. * @dest_max_index: maximum index into @dest_pages (IN)
  120. * @dest_max_ofs: maximum offset within @dest_pages[@dest_max_index] (IN)
  121. * @xpage: the target page (-1 if none) (IN)
  122. * @xpage_done: set to 1 if xpage was completed successfully (IN/OUT)
  123. * @cb_start: compression block to decompress (IN)
  124. * @cb_size: size of compression block @cb_start in bytes (IN)
  125. * @i_size: file size when we started the read (IN)
  126. * @initialized_size: initialized file size when we started the read (IN)
  127. *
  128. * The caller must have disabled preemption. ntfs_decompress() reenables it when
  129. * the critical section is finished.
  130. *
  131. * This decompresses the compression block @cb_start into the array of
  132. * destination pages @dest_pages starting at index @dest_index into @dest_pages
  133. * and at offset @dest_pos into the page @dest_pages[@dest_index].
  134. *
  135. * When the page @dest_pages[@xpage] is completed, @xpage_done is set to 1.
  136. * If xpage is -1 or @xpage has not been completed, @xpage_done is not modified.
  137. *
  138. * @cb_start is a pointer to the compression block which needs decompressing
  139. * and @cb_size is the size of @cb_start in bytes (8-64kiB).
  140. *
  141. * Return 0 if success or -EOVERFLOW on error in the compressed stream.
  142. * @xpage_done indicates whether the target page (@dest_pages[@xpage]) was
  143. * completed during the decompression of the compression block (@cb_start).
  144. *
  145. * Warning: This function *REQUIRES* PAGE_SIZE >= 4096 or it will blow up
  146. * unpredicatbly! You have been warned!
  147. *
  148. * Note to hackers: This function may not sleep until it has finished accessing
  149. * the compression block @cb_start as it is a per-CPU buffer.
  150. */
  151. static int ntfs_decompress(struct page *dest_pages[], int *dest_index,
  152. int *dest_ofs, const int dest_max_index, const int dest_max_ofs,
  153. const int xpage, char *xpage_done, u8 *const cb_start,
  154. const u32 cb_size, const loff_t i_size,
  155. const s64 initialized_size)
  156. {
  157. /*
  158. * Pointers into the compressed data, i.e. the compression block (cb),
  159. * and the therein contained sub-blocks (sb).
  160. */
  161. u8 *cb_end = cb_start + cb_size; /* End of cb. */
  162. u8 *cb = cb_start; /* Current position in cb. */
  163. u8 *cb_sb_start = cb; /* Beginning of the current sb in the cb. */
  164. u8 *cb_sb_end; /* End of current sb / beginning of next sb. */
  165. /* Variables for uncompressed data / destination. */
  166. struct page *dp; /* Current destination page being worked on. */
  167. u8 *dp_addr; /* Current pointer into dp. */
  168. u8 *dp_sb_start; /* Start of current sub-block in dp. */
  169. u8 *dp_sb_end; /* End of current sb in dp (dp_sb_start +
  170. NTFS_SB_SIZE). */
  171. u16 do_sb_start; /* @dest_ofs when starting this sub-block. */
  172. u16 do_sb_end; /* @dest_ofs of end of this sb (do_sb_start +
  173. NTFS_SB_SIZE). */
  174. /* Variables for tag and token parsing. */
  175. u8 tag; /* Current tag. */
  176. int token; /* Loop counter for the eight tokens in tag. */
  177. /* Need this because we can't sleep, so need two stages. */
  178. int completed_pages[dest_max_index - *dest_index + 1];
  179. int nr_completed_pages = 0;
  180. /* Default error code. */
  181. int err = -EOVERFLOW;
  182. ntfs_debug("Entering, cb_size = 0x%x.", cb_size);
  183. do_next_sb:
  184. ntfs_debug("Beginning sub-block at offset = 0x%zx in the cb.",
  185. cb - cb_start);
  186. /*
  187. * Have we reached the end of the compression block or the end of the
  188. * decompressed data? The latter can happen for example if the current
  189. * position in the compression block is one byte before its end so the
  190. * first two checks do not detect it.
  191. */
  192. if (cb == cb_end || !le16_to_cpup((le16*)cb) ||
  193. (*dest_index == dest_max_index &&
  194. *dest_ofs == dest_max_ofs)) {
  195. int i;
  196. ntfs_debug("Completed. Returning success (0).");
  197. err = 0;
  198. return_error:
  199. /* We can sleep from now on, so we drop lock. */
  200. spin_unlock(&ntfs_cb_lock);
  201. /* Second stage: finalize completed pages. */
  202. if (nr_completed_pages > 0) {
  203. for (i = 0; i < nr_completed_pages; i++) {
  204. int di = completed_pages[i];
  205. dp = dest_pages[di];
  206. /*
  207. * If we are outside the initialized size, zero
  208. * the out of bounds page range.
  209. */
  210. handle_bounds_compressed_page(dp, i_size,
  211. initialized_size);
  212. flush_dcache_page(dp);
  213. kunmap(dp);
  214. SetPageUptodate(dp);
  215. unlock_page(dp);
  216. if (di == xpage)
  217. *xpage_done = 1;
  218. else
  219. put_page(dp);
  220. dest_pages[di] = NULL;
  221. }
  222. }
  223. return err;
  224. }
  225. /* Setup offsets for the current sub-block destination. */
  226. do_sb_start = *dest_ofs;
  227. do_sb_end = do_sb_start + NTFS_SB_SIZE;
  228. /* Check that we are still within allowed boundaries. */
  229. if (*dest_index == dest_max_index && do_sb_end > dest_max_ofs)
  230. goto return_overflow;
  231. /* Does the minimum size of a compressed sb overflow valid range? */
  232. if (cb + 6 > cb_end)
  233. goto return_overflow;
  234. /* Setup the current sub-block source pointers and validate range. */
  235. cb_sb_start = cb;
  236. cb_sb_end = cb_sb_start + (le16_to_cpup((le16*)cb) & NTFS_SB_SIZE_MASK)
  237. + 3;
  238. if (cb_sb_end > cb_end)
  239. goto return_overflow;
  240. /* Get the current destination page. */
  241. dp = dest_pages[*dest_index];
  242. if (!dp) {
  243. /* No page present. Skip decompression of this sub-block. */
  244. cb = cb_sb_end;
  245. /* Advance destination position to next sub-block. */
  246. *dest_ofs = (*dest_ofs + NTFS_SB_SIZE) & ~PAGE_MASK;
  247. if (!*dest_ofs && (++*dest_index > dest_max_index))
  248. goto return_overflow;
  249. goto do_next_sb;
  250. }
  251. /* We have a valid destination page. Setup the destination pointers. */
  252. dp_addr = (u8*)page_address(dp) + do_sb_start;
  253. /* Now, we are ready to process the current sub-block (sb). */
  254. if (!(le16_to_cpup((le16*)cb) & NTFS_SB_IS_COMPRESSED)) {
  255. ntfs_debug("Found uncompressed sub-block.");
  256. /* This sb is not compressed, just copy it into destination. */
  257. /* Advance source position to first data byte. */
  258. cb += 2;
  259. /* An uncompressed sb must be full size. */
  260. if (cb_sb_end - cb != NTFS_SB_SIZE)
  261. goto return_overflow;
  262. /* Copy the block and advance the source position. */
  263. memcpy(dp_addr, cb, NTFS_SB_SIZE);
  264. cb += NTFS_SB_SIZE;
  265. /* Advance destination position to next sub-block. */
  266. *dest_ofs += NTFS_SB_SIZE;
  267. if (!(*dest_ofs &= ~PAGE_MASK)) {
  268. finalize_page:
  269. /*
  270. * First stage: add current page index to array of
  271. * completed pages.
  272. */
  273. completed_pages[nr_completed_pages++] = *dest_index;
  274. if (++*dest_index > dest_max_index)
  275. goto return_overflow;
  276. }
  277. goto do_next_sb;
  278. }
  279. ntfs_debug("Found compressed sub-block.");
  280. /* This sb is compressed, decompress it into destination. */
  281. /* Setup destination pointers. */
  282. dp_sb_start = dp_addr;
  283. dp_sb_end = dp_sb_start + NTFS_SB_SIZE;
  284. /* Forward to the first tag in the sub-block. */
  285. cb += 2;
  286. do_next_tag:
  287. if (cb == cb_sb_end) {
  288. /* Check if the decompressed sub-block was not full-length. */
  289. if (dp_addr < dp_sb_end) {
  290. int nr_bytes = do_sb_end - *dest_ofs;
  291. ntfs_debug("Filling incomplete sub-block with "
  292. "zeroes.");
  293. /* Zero remainder and update destination position. */
  294. memset(dp_addr, 0, nr_bytes);
  295. *dest_ofs += nr_bytes;
  296. }
  297. /* We have finished the current sub-block. */
  298. if (!(*dest_ofs &= ~PAGE_MASK))
  299. goto finalize_page;
  300. goto do_next_sb;
  301. }
  302. /* Check we are still in range. */
  303. if (cb > cb_sb_end || dp_addr > dp_sb_end)
  304. goto return_overflow;
  305. /* Get the next tag and advance to first token. */
  306. tag = *cb++;
  307. /* Parse the eight tokens described by the tag. */
  308. for (token = 0; token < 8; token++, tag >>= 1) {
  309. u16 lg, pt, length, max_non_overlap;
  310. register u16 i;
  311. u8 *dp_back_addr;
  312. /* Check if we are done / still in range. */
  313. if (cb >= cb_sb_end || dp_addr > dp_sb_end)
  314. break;
  315. /* Determine token type and parse appropriately.*/
  316. if ((tag & NTFS_TOKEN_MASK) == NTFS_SYMBOL_TOKEN) {
  317. /*
  318. * We have a symbol token, copy the symbol across, and
  319. * advance the source and destination positions.
  320. */
  321. *dp_addr++ = *cb++;
  322. ++*dest_ofs;
  323. /* Continue with the next token. */
  324. continue;
  325. }
  326. /*
  327. * We have a phrase token. Make sure it is not the first tag in
  328. * the sb as this is illegal and would confuse the code below.
  329. */
  330. if (dp_addr == dp_sb_start)
  331. goto return_overflow;
  332. /*
  333. * Determine the number of bytes to go back (p) and the number
  334. * of bytes to copy (l). We use an optimized algorithm in which
  335. * we first calculate log2(current destination position in sb),
  336. * which allows determination of l and p in O(1) rather than
  337. * O(n). We just need an arch-optimized log2() function now.
  338. */
  339. lg = 0;
  340. for (i = *dest_ofs - do_sb_start - 1; i >= 0x10; i >>= 1)
  341. lg++;
  342. /* Get the phrase token into i. */
  343. pt = le16_to_cpup((le16*)cb);
  344. /*
  345. * Calculate starting position of the byte sequence in
  346. * the destination using the fact that p = (pt >> (12 - lg)) + 1
  347. * and make sure we don't go too far back.
  348. */
  349. dp_back_addr = dp_addr - (pt >> (12 - lg)) - 1;
  350. if (dp_back_addr < dp_sb_start)
  351. goto return_overflow;
  352. /* Now calculate the length of the byte sequence. */
  353. length = (pt & (0xfff >> lg)) + 3;
  354. /* Advance destination position and verify it is in range. */
  355. *dest_ofs += length;
  356. if (*dest_ofs > do_sb_end)
  357. goto return_overflow;
  358. /* The number of non-overlapping bytes. */
  359. max_non_overlap = dp_addr - dp_back_addr;
  360. if (length <= max_non_overlap) {
  361. /* The byte sequence doesn't overlap, just copy it. */
  362. memcpy(dp_addr, dp_back_addr, length);
  363. /* Advance destination pointer. */
  364. dp_addr += length;
  365. } else {
  366. /*
  367. * The byte sequence does overlap, copy non-overlapping
  368. * part and then do a slow byte by byte copy for the
  369. * overlapping part. Also, advance the destination
  370. * pointer.
  371. */
  372. memcpy(dp_addr, dp_back_addr, max_non_overlap);
  373. dp_addr += max_non_overlap;
  374. dp_back_addr += max_non_overlap;
  375. length -= max_non_overlap;
  376. while (length--)
  377. *dp_addr++ = *dp_back_addr++;
  378. }
  379. /* Advance source position and continue with the next token. */
  380. cb += 2;
  381. }
  382. /* No tokens left in the current tag. Continue with the next tag. */
  383. goto do_next_tag;
  384. return_overflow:
  385. ntfs_error(NULL, "Failed. Returning -EOVERFLOW.");
  386. goto return_error;
  387. }
  388. /**
  389. * ntfs_read_compressed_block - read a compressed block into the page cache
  390. * @page: locked page in the compression block(s) we need to read
  391. *
  392. * When we are called the page has already been verified to be locked and the
  393. * attribute is known to be non-resident, not encrypted, but compressed.
  394. *
  395. * 1. Determine which compression block(s) @page is in.
  396. * 2. Get hold of all pages corresponding to this/these compression block(s).
  397. * 3. Read the (first) compression block.
  398. * 4. Decompress it into the corresponding pages.
  399. * 5. Throw the compressed data away and proceed to 3. for the next compression
  400. * block or return success if no more compression blocks left.
  401. *
  402. * Warning: We have to be careful what we do about existing pages. They might
  403. * have been written to so that we would lose data if we were to just overwrite
  404. * them with the out-of-date uncompressed data.
  405. *
  406. * FIXME: For PAGE_SIZE > cb_size we are not doing the Right Thing(TM) at
  407. * the end of the file I think. We need to detect this case and zero the out
  408. * of bounds remainder of the page in question and mark it as handled. At the
  409. * moment we would just return -EIO on such a page. This bug will only become
  410. * apparent if pages are above 8kiB and the NTFS volume only uses 512 byte
  411. * clusters so is probably not going to be seen by anyone. Still this should
  412. * be fixed. (AIA)
  413. *
  414. * FIXME: Again for PAGE_SIZE > cb_size we are screwing up both in
  415. * handling sparse and compressed cbs. (AIA)
  416. *
  417. * FIXME: At the moment we don't do any zeroing out in the case that
  418. * initialized_size is less than data_size. This should be safe because of the
  419. * nature of the compression algorithm used. Just in case we check and output
  420. * an error message in read inode if the two sizes are not equal for a
  421. * compressed file. (AIA)
  422. */
  423. int ntfs_read_compressed_block(struct page *page)
  424. {
  425. loff_t i_size;
  426. s64 initialized_size;
  427. struct address_space *mapping = page->mapping;
  428. ntfs_inode *ni = NTFS_I(mapping->host);
  429. ntfs_volume *vol = ni->vol;
  430. struct super_block *sb = vol->sb;
  431. runlist_element *rl;
  432. unsigned long flags, block_size = sb->s_blocksize;
  433. unsigned char block_size_bits = sb->s_blocksize_bits;
  434. u8 *cb, *cb_pos, *cb_end;
  435. struct buffer_head **bhs;
  436. unsigned long offset, index = page->index;
  437. u32 cb_size = ni->itype.compressed.block_size;
  438. u64 cb_size_mask = cb_size - 1UL;
  439. VCN vcn;
  440. LCN lcn;
  441. /* The first wanted vcn (minimum alignment is PAGE_SIZE). */
  442. VCN start_vcn = (((s64)index << PAGE_SHIFT) & ~cb_size_mask) >>
  443. vol->cluster_size_bits;
  444. /*
  445. * The first vcn after the last wanted vcn (minimum alignment is again
  446. * PAGE_SIZE.
  447. */
  448. VCN end_vcn = ((((s64)(index + 1UL) << PAGE_SHIFT) + cb_size - 1)
  449. & ~cb_size_mask) >> vol->cluster_size_bits;
  450. /* Number of compression blocks (cbs) in the wanted vcn range. */
  451. unsigned int nr_cbs = (end_vcn - start_vcn) << vol->cluster_size_bits
  452. >> ni->itype.compressed.block_size_bits;
  453. /*
  454. * Number of pages required to store the uncompressed data from all
  455. * compression blocks (cbs) overlapping @page. Due to alignment
  456. * guarantees of start_vcn and end_vcn, no need to round up here.
  457. */
  458. unsigned int nr_pages = (end_vcn - start_vcn) <<
  459. vol->cluster_size_bits >> PAGE_SHIFT;
  460. unsigned int xpage, max_page, cur_page, cur_ofs, i;
  461. unsigned int cb_clusters, cb_max_ofs;
  462. int block, max_block, cb_max_page, bhs_size, nr_bhs, err = 0;
  463. struct page **pages;
  464. unsigned char xpage_done = 0;
  465. ntfs_debug("Entering, page->index = 0x%lx, cb_size = 0x%x, nr_pages = "
  466. "%i.", index, cb_size, nr_pages);
  467. /*
  468. * Bad things happen if we get here for anything that is not an
  469. * unnamed $DATA attribute.
  470. */
  471. BUG_ON(ni->type != AT_DATA);
  472. BUG_ON(ni->name_len);
  473. pages = kmalloc(nr_pages * sizeof(struct page *), GFP_NOFS);
  474. /* Allocate memory to store the buffer heads we need. */
  475. bhs_size = cb_size / block_size * sizeof(struct buffer_head *);
  476. bhs = kmalloc(bhs_size, GFP_NOFS);
  477. if (unlikely(!pages || !bhs)) {
  478. kfree(bhs);
  479. kfree(pages);
  480. unlock_page(page);
  481. ntfs_error(vol->sb, "Failed to allocate internal buffers.");
  482. return -ENOMEM;
  483. }
  484. /*
  485. * We have already been given one page, this is the one we must do.
  486. * Once again, the alignment guarantees keep it simple.
  487. */
  488. offset = start_vcn << vol->cluster_size_bits >> PAGE_SHIFT;
  489. xpage = index - offset;
  490. pages[xpage] = page;
  491. /*
  492. * The remaining pages need to be allocated and inserted into the page
  493. * cache, alignment guarantees keep all the below much simpler. (-8
  494. */
  495. read_lock_irqsave(&ni->size_lock, flags);
  496. i_size = i_size_read(VFS_I(ni));
  497. initialized_size = ni->initialized_size;
  498. read_unlock_irqrestore(&ni->size_lock, flags);
  499. max_page = ((i_size + PAGE_SIZE - 1) >> PAGE_SHIFT) -
  500. offset;
  501. /* Is the page fully outside i_size? (truncate in progress) */
  502. if (xpage >= max_page) {
  503. kfree(bhs);
  504. kfree(pages);
  505. zero_user(page, 0, PAGE_SIZE);
  506. ntfs_debug("Compressed read outside i_size - truncated?");
  507. SetPageUptodate(page);
  508. unlock_page(page);
  509. return 0;
  510. }
  511. if (nr_pages < max_page)
  512. max_page = nr_pages;
  513. for (i = 0; i < max_page; i++, offset++) {
  514. if (i != xpage)
  515. pages[i] = grab_cache_page_nowait(mapping, offset);
  516. page = pages[i];
  517. if (page) {
  518. /*
  519. * We only (re)read the page if it isn't already read
  520. * in and/or dirty or we would be losing data or at
  521. * least wasting our time.
  522. */
  523. if (!PageDirty(page) && (!PageUptodate(page) ||
  524. PageError(page))) {
  525. ClearPageError(page);
  526. kmap(page);
  527. continue;
  528. }
  529. unlock_page(page);
  530. put_page(page);
  531. pages[i] = NULL;
  532. }
  533. }
  534. /*
  535. * We have the runlist, and all the destination pages we need to fill.
  536. * Now read the first compression block.
  537. */
  538. cur_page = 0;
  539. cur_ofs = 0;
  540. cb_clusters = ni->itype.compressed.block_clusters;
  541. do_next_cb:
  542. nr_cbs--;
  543. nr_bhs = 0;
  544. /* Read all cb buffer heads one cluster at a time. */
  545. rl = NULL;
  546. for (vcn = start_vcn, start_vcn += cb_clusters; vcn < start_vcn;
  547. vcn++) {
  548. bool is_retry = false;
  549. if (!rl) {
  550. lock_retry_remap:
  551. down_read(&ni->runlist.lock);
  552. rl = ni->runlist.rl;
  553. }
  554. if (likely(rl != NULL)) {
  555. /* Seek to element containing target vcn. */
  556. while (rl->length && rl[1].vcn <= vcn)
  557. rl++;
  558. lcn = ntfs_rl_vcn_to_lcn(rl, vcn);
  559. } else
  560. lcn = LCN_RL_NOT_MAPPED;
  561. ntfs_debug("Reading vcn = 0x%llx, lcn = 0x%llx.",
  562. (unsigned long long)vcn,
  563. (unsigned long long)lcn);
  564. if (lcn < 0) {
  565. /*
  566. * When we reach the first sparse cluster we have
  567. * finished with the cb.
  568. */
  569. if (lcn == LCN_HOLE)
  570. break;
  571. if (is_retry || lcn != LCN_RL_NOT_MAPPED)
  572. goto rl_err;
  573. is_retry = true;
  574. /*
  575. * Attempt to map runlist, dropping lock for the
  576. * duration.
  577. */
  578. up_read(&ni->runlist.lock);
  579. if (!ntfs_map_runlist(ni, vcn))
  580. goto lock_retry_remap;
  581. goto map_rl_err;
  582. }
  583. block = lcn << vol->cluster_size_bits >> block_size_bits;
  584. /* Read the lcn from device in chunks of block_size bytes. */
  585. max_block = block + (vol->cluster_size >> block_size_bits);
  586. do {
  587. ntfs_debug("block = 0x%x.", block);
  588. if (unlikely(!(bhs[nr_bhs] = sb_getblk(sb, block))))
  589. goto getblk_err;
  590. nr_bhs++;
  591. } while (++block < max_block);
  592. }
  593. /* Release the lock if we took it. */
  594. if (rl)
  595. up_read(&ni->runlist.lock);
  596. /* Setup and initiate io on all buffer heads. */
  597. for (i = 0; i < nr_bhs; i++) {
  598. struct buffer_head *tbh = bhs[i];
  599. if (!trylock_buffer(tbh))
  600. continue;
  601. if (unlikely(buffer_uptodate(tbh))) {
  602. unlock_buffer(tbh);
  603. continue;
  604. }
  605. get_bh(tbh);
  606. tbh->b_end_io = end_buffer_read_sync;
  607. submit_bh(REQ_OP_READ, 0, tbh);
  608. }
  609. /* Wait for io completion on all buffer heads. */
  610. for (i = 0; i < nr_bhs; i++) {
  611. struct buffer_head *tbh = bhs[i];
  612. if (buffer_uptodate(tbh))
  613. continue;
  614. wait_on_buffer(tbh);
  615. /*
  616. * We need an optimization barrier here, otherwise we start
  617. * hitting the below fixup code when accessing a loopback
  618. * mounted ntfs partition. This indicates either there is a
  619. * race condition in the loop driver or, more likely, gcc
  620. * overoptimises the code without the barrier and it doesn't
  621. * do the Right Thing(TM).
  622. */
  623. barrier();
  624. if (unlikely(!buffer_uptodate(tbh))) {
  625. ntfs_warning(vol->sb, "Buffer is unlocked but not "
  626. "uptodate! Unplugging the disk queue "
  627. "and rescheduling.");
  628. get_bh(tbh);
  629. io_schedule();
  630. put_bh(tbh);
  631. if (unlikely(!buffer_uptodate(tbh)))
  632. goto read_err;
  633. ntfs_warning(vol->sb, "Buffer is now uptodate. Good.");
  634. }
  635. }
  636. /*
  637. * Get the compression buffer. We must not sleep any more
  638. * until we are finished with it.
  639. */
  640. spin_lock(&ntfs_cb_lock);
  641. cb = ntfs_compression_buffer;
  642. BUG_ON(!cb);
  643. cb_pos = cb;
  644. cb_end = cb + cb_size;
  645. /* Copy the buffer heads into the contiguous buffer. */
  646. for (i = 0; i < nr_bhs; i++) {
  647. memcpy(cb_pos, bhs[i]->b_data, block_size);
  648. cb_pos += block_size;
  649. }
  650. /* Just a precaution. */
  651. if (cb_pos + 2 <= cb + cb_size)
  652. *(u16*)cb_pos = 0;
  653. /* Reset cb_pos back to the beginning. */
  654. cb_pos = cb;
  655. /* We now have both source (if present) and destination. */
  656. ntfs_debug("Successfully read the compression block.");
  657. /* The last page and maximum offset within it for the current cb. */
  658. cb_max_page = (cur_page << PAGE_SHIFT) + cur_ofs + cb_size;
  659. cb_max_ofs = cb_max_page & ~PAGE_MASK;
  660. cb_max_page >>= PAGE_SHIFT;
  661. /* Catch end of file inside a compression block. */
  662. if (cb_max_page > max_page)
  663. cb_max_page = max_page;
  664. if (vcn == start_vcn - cb_clusters) {
  665. /* Sparse cb, zero out page range overlapping the cb. */
  666. ntfs_debug("Found sparse compression block.");
  667. /* We can sleep from now on, so we drop lock. */
  668. spin_unlock(&ntfs_cb_lock);
  669. if (cb_max_ofs)
  670. cb_max_page--;
  671. for (; cur_page < cb_max_page; cur_page++) {
  672. page = pages[cur_page];
  673. if (page) {
  674. if (likely(!cur_ofs))
  675. clear_page(page_address(page));
  676. else
  677. memset(page_address(page) + cur_ofs, 0,
  678. PAGE_SIZE -
  679. cur_ofs);
  680. flush_dcache_page(page);
  681. kunmap(page);
  682. SetPageUptodate(page);
  683. unlock_page(page);
  684. if (cur_page == xpage)
  685. xpage_done = 1;
  686. else
  687. put_page(page);
  688. pages[cur_page] = NULL;
  689. }
  690. cb_pos += PAGE_SIZE - cur_ofs;
  691. cur_ofs = 0;
  692. if (cb_pos >= cb_end)
  693. break;
  694. }
  695. /* If we have a partial final page, deal with it now. */
  696. if (cb_max_ofs && cb_pos < cb_end) {
  697. page = pages[cur_page];
  698. if (page)
  699. memset(page_address(page) + cur_ofs, 0,
  700. cb_max_ofs - cur_ofs);
  701. /*
  702. * No need to update cb_pos at this stage:
  703. * cb_pos += cb_max_ofs - cur_ofs;
  704. */
  705. cur_ofs = cb_max_ofs;
  706. }
  707. } else if (vcn == start_vcn) {
  708. /* We can't sleep so we need two stages. */
  709. unsigned int cur2_page = cur_page;
  710. unsigned int cur_ofs2 = cur_ofs;
  711. u8 *cb_pos2 = cb_pos;
  712. ntfs_debug("Found uncompressed compression block.");
  713. /* Uncompressed cb, copy it to the destination pages. */
  714. /*
  715. * TODO: As a big optimization, we could detect this case
  716. * before we read all the pages and use block_read_full_page()
  717. * on all full pages instead (we still have to treat partial
  718. * pages especially but at least we are getting rid of the
  719. * synchronous io for the majority of pages.
  720. * Or if we choose not to do the read-ahead/-behind stuff, we
  721. * could just return block_read_full_page(pages[xpage]) as long
  722. * as PAGE_SIZE <= cb_size.
  723. */
  724. if (cb_max_ofs)
  725. cb_max_page--;
  726. /* First stage: copy data into destination pages. */
  727. for (; cur_page < cb_max_page; cur_page++) {
  728. page = pages[cur_page];
  729. if (page)
  730. memcpy(page_address(page) + cur_ofs, cb_pos,
  731. PAGE_SIZE - cur_ofs);
  732. cb_pos += PAGE_SIZE - cur_ofs;
  733. cur_ofs = 0;
  734. if (cb_pos >= cb_end)
  735. break;
  736. }
  737. /* If we have a partial final page, deal with it now. */
  738. if (cb_max_ofs && cb_pos < cb_end) {
  739. page = pages[cur_page];
  740. if (page)
  741. memcpy(page_address(page) + cur_ofs, cb_pos,
  742. cb_max_ofs - cur_ofs);
  743. cb_pos += cb_max_ofs - cur_ofs;
  744. cur_ofs = cb_max_ofs;
  745. }
  746. /* We can sleep from now on, so drop lock. */
  747. spin_unlock(&ntfs_cb_lock);
  748. /* Second stage: finalize pages. */
  749. for (; cur2_page < cb_max_page; cur2_page++) {
  750. page = pages[cur2_page];
  751. if (page) {
  752. /*
  753. * If we are outside the initialized size, zero
  754. * the out of bounds page range.
  755. */
  756. handle_bounds_compressed_page(page, i_size,
  757. initialized_size);
  758. flush_dcache_page(page);
  759. kunmap(page);
  760. SetPageUptodate(page);
  761. unlock_page(page);
  762. if (cur2_page == xpage)
  763. xpage_done = 1;
  764. else
  765. put_page(page);
  766. pages[cur2_page] = NULL;
  767. }
  768. cb_pos2 += PAGE_SIZE - cur_ofs2;
  769. cur_ofs2 = 0;
  770. if (cb_pos2 >= cb_end)
  771. break;
  772. }
  773. } else {
  774. /* Compressed cb, decompress it into the destination page(s). */
  775. unsigned int prev_cur_page = cur_page;
  776. ntfs_debug("Found compressed compression block.");
  777. err = ntfs_decompress(pages, &cur_page, &cur_ofs,
  778. cb_max_page, cb_max_ofs, xpage, &xpage_done,
  779. cb_pos, cb_size - (cb_pos - cb), i_size,
  780. initialized_size);
  781. /*
  782. * We can sleep from now on, lock already dropped by
  783. * ntfs_decompress().
  784. */
  785. if (err) {
  786. ntfs_error(vol->sb, "ntfs_decompress() failed in inode "
  787. "0x%lx with error code %i. Skipping "
  788. "this compression block.",
  789. ni->mft_no, -err);
  790. /* Release the unfinished pages. */
  791. for (; prev_cur_page < cur_page; prev_cur_page++) {
  792. page = pages[prev_cur_page];
  793. if (page) {
  794. flush_dcache_page(page);
  795. kunmap(page);
  796. unlock_page(page);
  797. if (prev_cur_page != xpage)
  798. put_page(page);
  799. pages[prev_cur_page] = NULL;
  800. }
  801. }
  802. }
  803. }
  804. /* Release the buffer heads. */
  805. for (i = 0; i < nr_bhs; i++)
  806. brelse(bhs[i]);
  807. /* Do we have more work to do? */
  808. if (nr_cbs)
  809. goto do_next_cb;
  810. /* We no longer need the list of buffer heads. */
  811. kfree(bhs);
  812. /* Clean up if we have any pages left. Should never happen. */
  813. for (cur_page = 0; cur_page < max_page; cur_page++) {
  814. page = pages[cur_page];
  815. if (page) {
  816. ntfs_error(vol->sb, "Still have pages left! "
  817. "Terminating them with extreme "
  818. "prejudice. Inode 0x%lx, page index "
  819. "0x%lx.", ni->mft_no, page->index);
  820. flush_dcache_page(page);
  821. kunmap(page);
  822. unlock_page(page);
  823. if (cur_page != xpage)
  824. put_page(page);
  825. pages[cur_page] = NULL;
  826. }
  827. }
  828. /* We no longer need the list of pages. */
  829. kfree(pages);
  830. /* If we have completed the requested page, we return success. */
  831. if (likely(xpage_done))
  832. return 0;
  833. ntfs_debug("Failed. Returning error code %s.", err == -EOVERFLOW ?
  834. "EOVERFLOW" : (!err ? "EIO" : "unknown error"));
  835. return err < 0 ? err : -EIO;
  836. read_err:
  837. ntfs_error(vol->sb, "IO error while reading compressed data.");
  838. /* Release the buffer heads. */
  839. for (i = 0; i < nr_bhs; i++)
  840. brelse(bhs[i]);
  841. goto err_out;
  842. map_rl_err:
  843. ntfs_error(vol->sb, "ntfs_map_runlist() failed. Cannot read "
  844. "compression block.");
  845. goto err_out;
  846. rl_err:
  847. up_read(&ni->runlist.lock);
  848. ntfs_error(vol->sb, "ntfs_rl_vcn_to_lcn() failed. Cannot read "
  849. "compression block.");
  850. goto err_out;
  851. getblk_err:
  852. up_read(&ni->runlist.lock);
  853. ntfs_error(vol->sb, "getblk() failed. Cannot read compression block.");
  854. err_out:
  855. kfree(bhs);
  856. for (i = cur_page; i < max_page; i++) {
  857. page = pages[i];
  858. if (page) {
  859. flush_dcache_page(page);
  860. kunmap(page);
  861. unlock_page(page);
  862. if (i != xpage)
  863. put_page(page);
  864. }
  865. }
  866. kfree(pages);
  867. return -EIO;
  868. }