compression.c 27 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047
  1. /*
  2. * Copyright (C) 2008 Oracle. All rights reserved.
  3. *
  4. * This program is free software; you can redistribute it and/or
  5. * modify it under the terms of the GNU General Public
  6. * License v2 as published by the Free Software Foundation.
  7. *
  8. * This program is distributed in the hope that it will be useful,
  9. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  10. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  11. * General Public License for more details.
  12. *
  13. * You should have received a copy of the GNU General Public
  14. * License along with this program; if not, write to the
  15. * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  16. * Boston, MA 021110-1307, USA.
  17. */
  18. #include <linux/kernel.h>
  19. #include <linux/bio.h>
  20. #include <linux/buffer_head.h>
  21. #include <linux/file.h>
  22. #include <linux/fs.h>
  23. #include <linux/pagemap.h>
  24. #include <linux/highmem.h>
  25. #include <linux/time.h>
  26. #include <linux/init.h>
  27. #include <linux/string.h>
  28. #include <linux/backing-dev.h>
  29. #include <linux/mpage.h>
  30. #include <linux/swap.h>
  31. #include <linux/writeback.h>
  32. #include <linux/bit_spinlock.h>
  33. #include <linux/slab.h>
  34. #include "compat.h"
  35. #include "ctree.h"
  36. #include "disk-io.h"
  37. #include "transaction.h"
  38. #include "btrfs_inode.h"
  39. #include "volumes.h"
  40. #include "ordered-data.h"
  41. #include "compression.h"
  42. #include "extent_io.h"
  43. #include "extent_map.h"
  44. struct compressed_bio {
  45. /* number of bios pending for this compressed extent */
  46. atomic_t pending_bios;
  47. /* the pages with the compressed data on them */
  48. struct page **compressed_pages;
  49. /* inode that owns this data */
  50. struct inode *inode;
  51. /* starting offset in the inode for our pages */
  52. u64 start;
  53. /* number of bytes in the inode we're working on */
  54. unsigned long len;
  55. /* number of bytes on disk */
  56. unsigned long compressed_len;
  57. /* the compression algorithm for this bio */
  58. int compress_type;
  59. /* number of compressed pages in the array */
  60. unsigned long nr_pages;
  61. /* IO errors */
  62. int errors;
  63. int mirror_num;
  64. /* for reads, this is the bio we are copying the data into */
  65. struct bio *orig_bio;
  66. /*
  67. * the start of a variable length array of checksums only
  68. * used by reads
  69. */
  70. u32 sums;
  71. };
  72. static inline int compressed_bio_size(struct btrfs_root *root,
  73. unsigned long disk_size)
  74. {
  75. u16 csum_size = btrfs_super_csum_size(root->fs_info->super_copy);
  76. return sizeof(struct compressed_bio) +
  77. ((disk_size + root->sectorsize - 1) / root->sectorsize) *
  78. csum_size;
  79. }
  80. static struct bio *compressed_bio_alloc(struct block_device *bdev,
  81. u64 first_byte, gfp_t gfp_flags)
  82. {
  83. int nr_vecs;
  84. nr_vecs = bio_get_nr_vecs(bdev);
  85. return btrfs_bio_alloc(bdev, first_byte >> 9, nr_vecs, gfp_flags);
  86. }
  87. static int check_compressed_csum(struct inode *inode,
  88. struct compressed_bio *cb,
  89. u64 disk_start)
  90. {
  91. int ret;
  92. struct page *page;
  93. unsigned long i;
  94. char *kaddr;
  95. u32 csum;
  96. u32 *cb_sum = &cb->sums;
  97. if (BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM)
  98. return 0;
  99. for (i = 0; i < cb->nr_pages; i++) {
  100. page = cb->compressed_pages[i];
  101. csum = ~(u32)0;
  102. kaddr = kmap_atomic(page);
  103. csum = btrfs_csum_data(kaddr, csum, PAGE_CACHE_SIZE);
  104. btrfs_csum_final(csum, (char *)&csum);
  105. kunmap_atomic(kaddr);
  106. if (csum != *cb_sum) {
  107. printk(KERN_INFO "btrfs csum failed ino %llu "
  108. "extent %llu csum %u "
  109. "wanted %u mirror %d\n",
  110. (unsigned long long)btrfs_ino(inode),
  111. (unsigned long long)disk_start,
  112. csum, *cb_sum, cb->mirror_num);
  113. ret = -EIO;
  114. goto fail;
  115. }
  116. cb_sum++;
  117. }
  118. ret = 0;
  119. fail:
  120. return ret;
  121. }
  122. /* when we finish reading compressed pages from the disk, we
  123. * decompress them and then run the bio end_io routines on the
  124. * decompressed pages (in the inode address space).
  125. *
  126. * This allows the checksumming and other IO error handling routines
  127. * to work normally
  128. *
  129. * The compressed pages are freed here, and it must be run
  130. * in process context
  131. */
  132. static void end_compressed_bio_read(struct bio *bio, int err)
  133. {
  134. struct compressed_bio *cb = bio->bi_private;
  135. struct inode *inode;
  136. struct page *page;
  137. unsigned long index;
  138. int ret;
  139. if (err)
  140. cb->errors = 1;
  141. /* if there are more bios still pending for this compressed
  142. * extent, just exit
  143. */
  144. if (!atomic_dec_and_test(&cb->pending_bios))
  145. goto out;
  146. inode = cb->inode;
  147. ret = check_compressed_csum(inode, cb, (u64)bio->bi_sector << 9);
  148. if (ret)
  149. goto csum_failed;
  150. /* ok, we're the last bio for this extent, lets start
  151. * the decompression.
  152. */
  153. ret = btrfs_decompress_biovec(cb->compress_type,
  154. cb->compressed_pages,
  155. cb->start,
  156. cb->orig_bio->bi_io_vec,
  157. cb->orig_bio->bi_vcnt,
  158. cb->compressed_len);
  159. csum_failed:
  160. if (ret)
  161. cb->errors = 1;
  162. /* release the compressed pages */
  163. index = 0;
  164. for (index = 0; index < cb->nr_pages; index++) {
  165. page = cb->compressed_pages[index];
  166. page->mapping = NULL;
  167. page_cache_release(page);
  168. }
  169. /* do io completion on the original bio */
  170. if (cb->errors) {
  171. bio_io_error(cb->orig_bio);
  172. } else {
  173. int bio_index = 0;
  174. struct bio_vec *bvec = cb->orig_bio->bi_io_vec;
  175. /*
  176. * we have verified the checksum already, set page
  177. * checked so the end_io handlers know about it
  178. */
  179. while (bio_index < cb->orig_bio->bi_vcnt) {
  180. SetPageChecked(bvec->bv_page);
  181. bvec++;
  182. bio_index++;
  183. }
  184. bio_endio(cb->orig_bio, 0);
  185. }
  186. /* finally free the cb struct */
  187. kfree(cb->compressed_pages);
  188. kfree(cb);
  189. out:
  190. bio_put(bio);
  191. }
  192. /*
  193. * Clear the writeback bits on all of the file
  194. * pages for a compressed write
  195. */
  196. static noinline void end_compressed_writeback(struct inode *inode, u64 start,
  197. unsigned long ram_size)
  198. {
  199. unsigned long index = start >> PAGE_CACHE_SHIFT;
  200. unsigned long end_index = (start + ram_size - 1) >> PAGE_CACHE_SHIFT;
  201. struct page *pages[16];
  202. unsigned long nr_pages = end_index - index + 1;
  203. int i;
  204. int ret;
  205. while (nr_pages > 0) {
  206. ret = find_get_pages_contig(inode->i_mapping, index,
  207. min_t(unsigned long,
  208. nr_pages, ARRAY_SIZE(pages)), pages);
  209. if (ret == 0) {
  210. nr_pages -= 1;
  211. index += 1;
  212. continue;
  213. }
  214. for (i = 0; i < ret; i++) {
  215. end_page_writeback(pages[i]);
  216. page_cache_release(pages[i]);
  217. }
  218. nr_pages -= ret;
  219. index += ret;
  220. }
  221. /* the inode may be gone now */
  222. }
  223. /*
  224. * do the cleanup once all the compressed pages hit the disk.
  225. * This will clear writeback on the file pages and free the compressed
  226. * pages.
  227. *
  228. * This also calls the writeback end hooks for the file pages so that
  229. * metadata and checksums can be updated in the file.
  230. */
  231. static void end_compressed_bio_write(struct bio *bio, int err)
  232. {
  233. struct extent_io_tree *tree;
  234. struct compressed_bio *cb = bio->bi_private;
  235. struct inode *inode;
  236. struct page *page;
  237. unsigned long index;
  238. if (err)
  239. cb->errors = 1;
  240. /* if there are more bios still pending for this compressed
  241. * extent, just exit
  242. */
  243. if (!atomic_dec_and_test(&cb->pending_bios))
  244. goto out;
  245. /* ok, we're the last bio for this extent, step one is to
  246. * call back into the FS and do all the end_io operations
  247. */
  248. inode = cb->inode;
  249. tree = &BTRFS_I(inode)->io_tree;
  250. cb->compressed_pages[0]->mapping = cb->inode->i_mapping;
  251. tree->ops->writepage_end_io_hook(cb->compressed_pages[0],
  252. cb->start,
  253. cb->start + cb->len - 1,
  254. NULL, 1);
  255. cb->compressed_pages[0]->mapping = NULL;
  256. end_compressed_writeback(inode, cb->start, cb->len);
  257. /* note, our inode could be gone now */
  258. /*
  259. * release the compressed pages, these came from alloc_page and
  260. * are not attached to the inode at all
  261. */
  262. index = 0;
  263. for (index = 0; index < cb->nr_pages; index++) {
  264. page = cb->compressed_pages[index];
  265. page->mapping = NULL;
  266. page_cache_release(page);
  267. }
  268. /* finally free the cb struct */
  269. kfree(cb->compressed_pages);
  270. kfree(cb);
  271. out:
  272. bio_put(bio);
  273. }
  274. /*
  275. * worker function to build and submit bios for previously compressed pages.
  276. * The corresponding pages in the inode should be marked for writeback
  277. * and the compressed pages should have a reference on them for dropping
  278. * when the IO is complete.
  279. *
  280. * This also checksums the file bytes and gets things ready for
  281. * the end io hooks.
  282. */
  283. int btrfs_submit_compressed_write(struct inode *inode, u64 start,
  284. unsigned long len, u64 disk_start,
  285. unsigned long compressed_len,
  286. struct page **compressed_pages,
  287. unsigned long nr_pages)
  288. {
  289. struct bio *bio = NULL;
  290. struct btrfs_root *root = BTRFS_I(inode)->root;
  291. struct compressed_bio *cb;
  292. unsigned long bytes_left;
  293. struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
  294. int pg_index = 0;
  295. struct page *page;
  296. u64 first_byte = disk_start;
  297. struct block_device *bdev;
  298. int ret;
  299. int skip_sum = BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM;
  300. WARN_ON(start & ((u64)PAGE_CACHE_SIZE - 1));
  301. cb = kmalloc(compressed_bio_size(root, compressed_len), GFP_NOFS);
  302. if (!cb)
  303. return -ENOMEM;
  304. atomic_set(&cb->pending_bios, 0);
  305. cb->errors = 0;
  306. cb->inode = inode;
  307. cb->start = start;
  308. cb->len = len;
  309. cb->mirror_num = 0;
  310. cb->compressed_pages = compressed_pages;
  311. cb->compressed_len = compressed_len;
  312. cb->orig_bio = NULL;
  313. cb->nr_pages = nr_pages;
  314. bdev = BTRFS_I(inode)->root->fs_info->fs_devices->latest_bdev;
  315. bio = compressed_bio_alloc(bdev, first_byte, GFP_NOFS);
  316. if(!bio) {
  317. kfree(cb);
  318. return -ENOMEM;
  319. }
  320. bio->bi_private = cb;
  321. bio->bi_end_io = end_compressed_bio_write;
  322. atomic_inc(&cb->pending_bios);
  323. /* create and submit bios for the compressed pages */
  324. bytes_left = compressed_len;
  325. for (pg_index = 0; pg_index < cb->nr_pages; pg_index++) {
  326. page = compressed_pages[pg_index];
  327. page->mapping = inode->i_mapping;
  328. if (bio->bi_size)
  329. ret = io_tree->ops->merge_bio_hook(WRITE, page, 0,
  330. PAGE_CACHE_SIZE,
  331. bio, 0);
  332. else
  333. ret = 0;
  334. page->mapping = NULL;
  335. if (ret || bio_add_page(bio, page, PAGE_CACHE_SIZE, 0) <
  336. PAGE_CACHE_SIZE) {
  337. bio_get(bio);
  338. /*
  339. * inc the count before we submit the bio so
  340. * we know the end IO handler won't happen before
  341. * we inc the count. Otherwise, the cb might get
  342. * freed before we're done setting it up
  343. */
  344. atomic_inc(&cb->pending_bios);
  345. ret = btrfs_bio_wq_end_io(root->fs_info, bio, 0);
  346. BUG_ON(ret); /* -ENOMEM */
  347. if (!skip_sum) {
  348. ret = btrfs_csum_one_bio(root, inode, bio,
  349. start, 1);
  350. BUG_ON(ret); /* -ENOMEM */
  351. }
  352. ret = btrfs_map_bio(root, WRITE, bio, 0, 1);
  353. BUG_ON(ret); /* -ENOMEM */
  354. bio_put(bio);
  355. bio = compressed_bio_alloc(bdev, first_byte, GFP_NOFS);
  356. BUG_ON(!bio);
  357. bio->bi_private = cb;
  358. bio->bi_end_io = end_compressed_bio_write;
  359. bio_add_page(bio, page, PAGE_CACHE_SIZE, 0);
  360. }
  361. if (bytes_left < PAGE_CACHE_SIZE) {
  362. printk("bytes left %lu compress len %lu nr %lu\n",
  363. bytes_left, cb->compressed_len, cb->nr_pages);
  364. }
  365. bytes_left -= PAGE_CACHE_SIZE;
  366. first_byte += PAGE_CACHE_SIZE;
  367. cond_resched();
  368. }
  369. bio_get(bio);
  370. ret = btrfs_bio_wq_end_io(root->fs_info, bio, 0);
  371. BUG_ON(ret); /* -ENOMEM */
  372. if (!skip_sum) {
  373. ret = btrfs_csum_one_bio(root, inode, bio, start, 1);
  374. BUG_ON(ret); /* -ENOMEM */
  375. }
  376. ret = btrfs_map_bio(root, WRITE, bio, 0, 1);
  377. BUG_ON(ret); /* -ENOMEM */
  378. bio_put(bio);
  379. return 0;
  380. }
  381. static noinline int add_ra_bio_pages(struct inode *inode,
  382. u64 compressed_end,
  383. struct compressed_bio *cb)
  384. {
  385. unsigned long end_index;
  386. unsigned long pg_index;
  387. u64 last_offset;
  388. u64 isize = i_size_read(inode);
  389. int ret;
  390. struct page *page;
  391. unsigned long nr_pages = 0;
  392. struct extent_map *em;
  393. struct address_space *mapping = inode->i_mapping;
  394. struct extent_map_tree *em_tree;
  395. struct extent_io_tree *tree;
  396. u64 end;
  397. int misses = 0;
  398. page = cb->orig_bio->bi_io_vec[cb->orig_bio->bi_vcnt - 1].bv_page;
  399. last_offset = (page_offset(page) + PAGE_CACHE_SIZE);
  400. em_tree = &BTRFS_I(inode)->extent_tree;
  401. tree = &BTRFS_I(inode)->io_tree;
  402. if (isize == 0)
  403. return 0;
  404. end_index = (i_size_read(inode) - 1) >> PAGE_CACHE_SHIFT;
  405. while (last_offset < compressed_end) {
  406. pg_index = last_offset >> PAGE_CACHE_SHIFT;
  407. if (pg_index > end_index)
  408. break;
  409. rcu_read_lock();
  410. page = radix_tree_lookup(&mapping->page_tree, pg_index);
  411. rcu_read_unlock();
  412. if (page) {
  413. misses++;
  414. if (misses > 4)
  415. break;
  416. goto next;
  417. }
  418. page = __page_cache_alloc(mapping_gfp_mask(mapping) &
  419. ~__GFP_FS);
  420. if (!page)
  421. break;
  422. if (add_to_page_cache_lru(page, mapping, pg_index,
  423. GFP_NOFS)) {
  424. page_cache_release(page);
  425. goto next;
  426. }
  427. end = last_offset + PAGE_CACHE_SIZE - 1;
  428. /*
  429. * at this point, we have a locked page in the page cache
  430. * for these bytes in the file. But, we have to make
  431. * sure they map to this compressed extent on disk.
  432. */
  433. set_page_extent_mapped(page);
  434. lock_extent(tree, last_offset, end);
  435. read_lock(&em_tree->lock);
  436. em = lookup_extent_mapping(em_tree, last_offset,
  437. PAGE_CACHE_SIZE);
  438. read_unlock(&em_tree->lock);
  439. if (!em || last_offset < em->start ||
  440. (last_offset + PAGE_CACHE_SIZE > extent_map_end(em)) ||
  441. (em->block_start >> 9) != cb->orig_bio->bi_sector) {
  442. free_extent_map(em);
  443. unlock_extent(tree, last_offset, end);
  444. unlock_page(page);
  445. page_cache_release(page);
  446. break;
  447. }
  448. free_extent_map(em);
  449. if (page->index == end_index) {
  450. char *userpage;
  451. size_t zero_offset = isize & (PAGE_CACHE_SIZE - 1);
  452. if (zero_offset) {
  453. int zeros;
  454. zeros = PAGE_CACHE_SIZE - zero_offset;
  455. userpage = kmap_atomic(page);
  456. memset(userpage + zero_offset, 0, zeros);
  457. flush_dcache_page(page);
  458. kunmap_atomic(userpage);
  459. }
  460. }
  461. ret = bio_add_page(cb->orig_bio, page,
  462. PAGE_CACHE_SIZE, 0);
  463. if (ret == PAGE_CACHE_SIZE) {
  464. nr_pages++;
  465. page_cache_release(page);
  466. } else {
  467. unlock_extent(tree, last_offset, end);
  468. unlock_page(page);
  469. page_cache_release(page);
  470. break;
  471. }
  472. next:
  473. last_offset += PAGE_CACHE_SIZE;
  474. }
  475. return 0;
  476. }
  477. /*
  478. * for a compressed read, the bio we get passed has all the inode pages
  479. * in it. We don't actually do IO on those pages but allocate new ones
  480. * to hold the compressed pages on disk.
  481. *
  482. * bio->bi_sector points to the compressed extent on disk
  483. * bio->bi_io_vec points to all of the inode pages
  484. * bio->bi_vcnt is a count of pages
  485. *
  486. * After the compressed pages are read, we copy the bytes into the
  487. * bio we were passed and then call the bio end_io calls
  488. */
  489. int btrfs_submit_compressed_read(struct inode *inode, struct bio *bio,
  490. int mirror_num, unsigned long bio_flags)
  491. {
  492. struct extent_io_tree *tree;
  493. struct extent_map_tree *em_tree;
  494. struct compressed_bio *cb;
  495. struct btrfs_root *root = BTRFS_I(inode)->root;
  496. unsigned long uncompressed_len = bio->bi_vcnt * PAGE_CACHE_SIZE;
  497. unsigned long compressed_len;
  498. unsigned long nr_pages;
  499. unsigned long pg_index;
  500. struct page *page;
  501. struct block_device *bdev;
  502. struct bio *comp_bio;
  503. u64 cur_disk_byte = (u64)bio->bi_sector << 9;
  504. u64 em_len;
  505. u64 em_start;
  506. struct extent_map *em;
  507. int ret = -ENOMEM;
  508. int faili = 0;
  509. u32 *sums;
  510. tree = &BTRFS_I(inode)->io_tree;
  511. em_tree = &BTRFS_I(inode)->extent_tree;
  512. /* we need the actual starting offset of this extent in the file */
  513. read_lock(&em_tree->lock);
  514. em = lookup_extent_mapping(em_tree,
  515. page_offset(bio->bi_io_vec->bv_page),
  516. PAGE_CACHE_SIZE);
  517. read_unlock(&em_tree->lock);
  518. if (!em)
  519. return -EIO;
  520. compressed_len = em->block_len;
  521. cb = kmalloc(compressed_bio_size(root, compressed_len), GFP_NOFS);
  522. if (!cb)
  523. goto out;
  524. atomic_set(&cb->pending_bios, 0);
  525. cb->errors = 0;
  526. cb->inode = inode;
  527. cb->mirror_num = mirror_num;
  528. sums = &cb->sums;
  529. cb->start = em->orig_start;
  530. em_len = em->len;
  531. em_start = em->start;
  532. free_extent_map(em);
  533. em = NULL;
  534. cb->len = uncompressed_len;
  535. cb->compressed_len = compressed_len;
  536. cb->compress_type = extent_compress_type(bio_flags);
  537. cb->orig_bio = bio;
  538. nr_pages = (compressed_len + PAGE_CACHE_SIZE - 1) /
  539. PAGE_CACHE_SIZE;
  540. cb->compressed_pages = kzalloc(sizeof(struct page *) * nr_pages,
  541. GFP_NOFS);
  542. if (!cb->compressed_pages)
  543. goto fail1;
  544. bdev = BTRFS_I(inode)->root->fs_info->fs_devices->latest_bdev;
  545. for (pg_index = 0; pg_index < nr_pages; pg_index++) {
  546. cb->compressed_pages[pg_index] = alloc_page(GFP_NOFS |
  547. __GFP_HIGHMEM);
  548. if (!cb->compressed_pages[pg_index]) {
  549. faili = pg_index - 1;
  550. ret = -ENOMEM;
  551. goto fail2;
  552. }
  553. }
  554. faili = nr_pages - 1;
  555. cb->nr_pages = nr_pages;
  556. add_ra_bio_pages(inode, em_start + em_len, cb);
  557. /* include any pages we added in add_ra-bio_pages */
  558. uncompressed_len = bio->bi_vcnt * PAGE_CACHE_SIZE;
  559. cb->len = uncompressed_len;
  560. comp_bio = compressed_bio_alloc(bdev, cur_disk_byte, GFP_NOFS);
  561. if (!comp_bio)
  562. goto fail2;
  563. comp_bio->bi_private = cb;
  564. comp_bio->bi_end_io = end_compressed_bio_read;
  565. atomic_inc(&cb->pending_bios);
  566. for (pg_index = 0; pg_index < nr_pages; pg_index++) {
  567. page = cb->compressed_pages[pg_index];
  568. page->mapping = inode->i_mapping;
  569. page->index = em_start >> PAGE_CACHE_SHIFT;
  570. if (comp_bio->bi_size)
  571. ret = tree->ops->merge_bio_hook(READ, page, 0,
  572. PAGE_CACHE_SIZE,
  573. comp_bio, 0);
  574. else
  575. ret = 0;
  576. page->mapping = NULL;
  577. if (ret || bio_add_page(comp_bio, page, PAGE_CACHE_SIZE, 0) <
  578. PAGE_CACHE_SIZE) {
  579. bio_get(comp_bio);
  580. ret = btrfs_bio_wq_end_io(root->fs_info, comp_bio, 0);
  581. BUG_ON(ret); /* -ENOMEM */
  582. /*
  583. * inc the count before we submit the bio so
  584. * we know the end IO handler won't happen before
  585. * we inc the count. Otherwise, the cb might get
  586. * freed before we're done setting it up
  587. */
  588. atomic_inc(&cb->pending_bios);
  589. if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM)) {
  590. ret = btrfs_lookup_bio_sums(root, inode,
  591. comp_bio, sums);
  592. BUG_ON(ret); /* -ENOMEM */
  593. }
  594. sums += (comp_bio->bi_size + root->sectorsize - 1) /
  595. root->sectorsize;
  596. ret = btrfs_map_bio(root, READ, comp_bio,
  597. mirror_num, 0);
  598. if (ret)
  599. bio_endio(comp_bio, ret);
  600. bio_put(comp_bio);
  601. comp_bio = compressed_bio_alloc(bdev, cur_disk_byte,
  602. GFP_NOFS);
  603. BUG_ON(!comp_bio);
  604. comp_bio->bi_private = cb;
  605. comp_bio->bi_end_io = end_compressed_bio_read;
  606. bio_add_page(comp_bio, page, PAGE_CACHE_SIZE, 0);
  607. }
  608. cur_disk_byte += PAGE_CACHE_SIZE;
  609. }
  610. bio_get(comp_bio);
  611. ret = btrfs_bio_wq_end_io(root->fs_info, comp_bio, 0);
  612. BUG_ON(ret); /* -ENOMEM */
  613. if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM)) {
  614. ret = btrfs_lookup_bio_sums(root, inode, comp_bio, sums);
  615. BUG_ON(ret); /* -ENOMEM */
  616. }
  617. ret = btrfs_map_bio(root, READ, comp_bio, mirror_num, 0);
  618. if (ret)
  619. bio_endio(comp_bio, ret);
  620. bio_put(comp_bio);
  621. return 0;
  622. fail2:
  623. while (faili >= 0) {
  624. __free_page(cb->compressed_pages[faili]);
  625. faili--;
  626. }
  627. kfree(cb->compressed_pages);
  628. fail1:
  629. kfree(cb);
  630. out:
  631. free_extent_map(em);
  632. return ret;
  633. }
  634. static struct list_head comp_idle_workspace[BTRFS_COMPRESS_TYPES];
  635. static spinlock_t comp_workspace_lock[BTRFS_COMPRESS_TYPES];
  636. static int comp_num_workspace[BTRFS_COMPRESS_TYPES];
  637. static atomic_t comp_alloc_workspace[BTRFS_COMPRESS_TYPES];
  638. static wait_queue_head_t comp_workspace_wait[BTRFS_COMPRESS_TYPES];
  639. struct btrfs_compress_op *btrfs_compress_op[] = {
  640. &btrfs_zlib_compress,
  641. &btrfs_lzo_compress,
  642. };
  643. void __init btrfs_init_compress(void)
  644. {
  645. int i;
  646. for (i = 0; i < BTRFS_COMPRESS_TYPES; i++) {
  647. INIT_LIST_HEAD(&comp_idle_workspace[i]);
  648. spin_lock_init(&comp_workspace_lock[i]);
  649. atomic_set(&comp_alloc_workspace[i], 0);
  650. init_waitqueue_head(&comp_workspace_wait[i]);
  651. }
  652. }
  653. /*
  654. * this finds an available workspace or allocates a new one
  655. * ERR_PTR is returned if things go bad.
  656. */
  657. static struct list_head *find_workspace(int type)
  658. {
  659. struct list_head *workspace;
  660. int cpus = num_online_cpus();
  661. int idx = type - 1;
  662. struct list_head *idle_workspace = &comp_idle_workspace[idx];
  663. spinlock_t *workspace_lock = &comp_workspace_lock[idx];
  664. atomic_t *alloc_workspace = &comp_alloc_workspace[idx];
  665. wait_queue_head_t *workspace_wait = &comp_workspace_wait[idx];
  666. int *num_workspace = &comp_num_workspace[idx];
  667. again:
  668. spin_lock(workspace_lock);
  669. if (!list_empty(idle_workspace)) {
  670. workspace = idle_workspace->next;
  671. list_del(workspace);
  672. (*num_workspace)--;
  673. spin_unlock(workspace_lock);
  674. return workspace;
  675. }
  676. if (atomic_read(alloc_workspace) > cpus) {
  677. DEFINE_WAIT(wait);
  678. spin_unlock(workspace_lock);
  679. prepare_to_wait(workspace_wait, &wait, TASK_UNINTERRUPTIBLE);
  680. if (atomic_read(alloc_workspace) > cpus && !*num_workspace)
  681. schedule();
  682. finish_wait(workspace_wait, &wait);
  683. goto again;
  684. }
  685. atomic_inc(alloc_workspace);
  686. spin_unlock(workspace_lock);
  687. workspace = btrfs_compress_op[idx]->alloc_workspace();
  688. if (IS_ERR(workspace)) {
  689. atomic_dec(alloc_workspace);
  690. wake_up(workspace_wait);
  691. }
  692. return workspace;
  693. }
  694. /*
  695. * put a workspace struct back on the list or free it if we have enough
  696. * idle ones sitting around
  697. */
  698. static void free_workspace(int type, struct list_head *workspace)
  699. {
  700. int idx = type - 1;
  701. struct list_head *idle_workspace = &comp_idle_workspace[idx];
  702. spinlock_t *workspace_lock = &comp_workspace_lock[idx];
  703. atomic_t *alloc_workspace = &comp_alloc_workspace[idx];
  704. wait_queue_head_t *workspace_wait = &comp_workspace_wait[idx];
  705. int *num_workspace = &comp_num_workspace[idx];
  706. spin_lock(workspace_lock);
  707. if (*num_workspace < num_online_cpus()) {
  708. list_add_tail(workspace, idle_workspace);
  709. (*num_workspace)++;
  710. spin_unlock(workspace_lock);
  711. goto wake;
  712. }
  713. spin_unlock(workspace_lock);
  714. btrfs_compress_op[idx]->free_workspace(workspace);
  715. atomic_dec(alloc_workspace);
  716. wake:
  717. smp_mb();
  718. if (waitqueue_active(workspace_wait))
  719. wake_up(workspace_wait);
  720. }
  721. /*
  722. * cleanup function for module exit
  723. */
  724. static void free_workspaces(void)
  725. {
  726. struct list_head *workspace;
  727. int i;
  728. for (i = 0; i < BTRFS_COMPRESS_TYPES; i++) {
  729. while (!list_empty(&comp_idle_workspace[i])) {
  730. workspace = comp_idle_workspace[i].next;
  731. list_del(workspace);
  732. btrfs_compress_op[i]->free_workspace(workspace);
  733. atomic_dec(&comp_alloc_workspace[i]);
  734. }
  735. }
  736. }
  737. /*
  738. * given an address space and start/len, compress the bytes.
  739. *
  740. * pages are allocated to hold the compressed result and stored
  741. * in 'pages'
  742. *
  743. * out_pages is used to return the number of pages allocated. There
  744. * may be pages allocated even if we return an error
  745. *
  746. * total_in is used to return the number of bytes actually read. It
  747. * may be smaller then len if we had to exit early because we
  748. * ran out of room in the pages array or because we cross the
  749. * max_out threshold.
  750. *
  751. * total_out is used to return the total number of compressed bytes
  752. *
  753. * max_out tells us the max number of bytes that we're allowed to
  754. * stuff into pages
  755. */
  756. int btrfs_compress_pages(int type, struct address_space *mapping,
  757. u64 start, unsigned long len,
  758. struct page **pages,
  759. unsigned long nr_dest_pages,
  760. unsigned long *out_pages,
  761. unsigned long *total_in,
  762. unsigned long *total_out,
  763. unsigned long max_out)
  764. {
  765. struct list_head *workspace;
  766. int ret;
  767. workspace = find_workspace(type);
  768. if (IS_ERR(workspace))
  769. return -1;
  770. ret = btrfs_compress_op[type-1]->compress_pages(workspace, mapping,
  771. start, len, pages,
  772. nr_dest_pages, out_pages,
  773. total_in, total_out,
  774. max_out);
  775. free_workspace(type, workspace);
  776. return ret;
  777. }
  778. /*
  779. * pages_in is an array of pages with compressed data.
  780. *
  781. * disk_start is the starting logical offset of this array in the file
  782. *
  783. * bvec is a bio_vec of pages from the file that we want to decompress into
  784. *
  785. * vcnt is the count of pages in the biovec
  786. *
  787. * srclen is the number of bytes in pages_in
  788. *
  789. * The basic idea is that we have a bio that was created by readpages.
  790. * The pages in the bio are for the uncompressed data, and they may not
  791. * be contiguous. They all correspond to the range of bytes covered by
  792. * the compressed extent.
  793. */
  794. int btrfs_decompress_biovec(int type, struct page **pages_in, u64 disk_start,
  795. struct bio_vec *bvec, int vcnt, size_t srclen)
  796. {
  797. struct list_head *workspace;
  798. int ret;
  799. workspace = find_workspace(type);
  800. if (IS_ERR(workspace))
  801. return -ENOMEM;
  802. ret = btrfs_compress_op[type-1]->decompress_biovec(workspace, pages_in,
  803. disk_start,
  804. bvec, vcnt, srclen);
  805. free_workspace(type, workspace);
  806. return ret;
  807. }
  808. /*
  809. * a less complex decompression routine. Our compressed data fits in a
  810. * single page, and we want to read a single page out of it.
  811. * start_byte tells us the offset into the compressed data we're interested in
  812. */
  813. int btrfs_decompress(int type, unsigned char *data_in, struct page *dest_page,
  814. unsigned long start_byte, size_t srclen, size_t destlen)
  815. {
  816. struct list_head *workspace;
  817. int ret;
  818. workspace = find_workspace(type);
  819. if (IS_ERR(workspace))
  820. return -ENOMEM;
  821. ret = btrfs_compress_op[type-1]->decompress(workspace, data_in,
  822. dest_page, start_byte,
  823. srclen, destlen);
  824. free_workspace(type, workspace);
  825. return ret;
  826. }
  827. void btrfs_exit_compress(void)
  828. {
  829. free_workspaces();
  830. }
  831. /*
  832. * Copy uncompressed data from working buffer to pages.
  833. *
  834. * buf_start is the byte offset we're of the start of our workspace buffer.
  835. *
  836. * total_out is the last byte of the buffer
  837. */
  838. int btrfs_decompress_buf2page(char *buf, unsigned long buf_start,
  839. unsigned long total_out, u64 disk_start,
  840. struct bio_vec *bvec, int vcnt,
  841. unsigned long *pg_index,
  842. unsigned long *pg_offset)
  843. {
  844. unsigned long buf_offset;
  845. unsigned long current_buf_start;
  846. unsigned long start_byte;
  847. unsigned long working_bytes = total_out - buf_start;
  848. unsigned long bytes;
  849. char *kaddr;
  850. struct page *page_out = bvec[*pg_index].bv_page;
  851. /*
  852. * start byte is the first byte of the page we're currently
  853. * copying into relative to the start of the compressed data.
  854. */
  855. start_byte = page_offset(page_out) - disk_start;
  856. /* we haven't yet hit data corresponding to this page */
  857. if (total_out <= start_byte)
  858. return 1;
  859. /*
  860. * the start of the data we care about is offset into
  861. * the middle of our working buffer
  862. */
  863. if (total_out > start_byte && buf_start < start_byte) {
  864. buf_offset = start_byte - buf_start;
  865. working_bytes -= buf_offset;
  866. } else {
  867. buf_offset = 0;
  868. }
  869. current_buf_start = buf_start;
  870. /* copy bytes from the working buffer into the pages */
  871. while (working_bytes > 0) {
  872. bytes = min(PAGE_CACHE_SIZE - *pg_offset,
  873. PAGE_CACHE_SIZE - buf_offset);
  874. bytes = min(bytes, working_bytes);
  875. kaddr = kmap_atomic(page_out);
  876. memcpy(kaddr + *pg_offset, buf + buf_offset, bytes);
  877. kunmap_atomic(kaddr);
  878. flush_dcache_page(page_out);
  879. *pg_offset += bytes;
  880. buf_offset += bytes;
  881. working_bytes -= bytes;
  882. current_buf_start += bytes;
  883. /* check if we need to pick another page */
  884. if (*pg_offset == PAGE_CACHE_SIZE) {
  885. (*pg_index)++;
  886. if (*pg_index >= vcnt)
  887. return 0;
  888. page_out = bvec[*pg_index].bv_page;
  889. *pg_offset = 0;
  890. start_byte = page_offset(page_out) - disk_start;
  891. /*
  892. * make sure our new page is covered by this
  893. * working buffer
  894. */
  895. if (total_out <= start_byte)
  896. return 1;
  897. /*
  898. * the next page in the biovec might not be adjacent
  899. * to the last page, but it might still be found
  900. * inside this working buffer. bump our offset pointer
  901. */
  902. if (total_out > start_byte &&
  903. current_buf_start < start_byte) {
  904. buf_offset = start_byte - buf_start;
  905. working_bytes = total_out - start_byte;
  906. current_buf_start = buf_start + buf_offset;
  907. }
  908. }
  909. }
  910. return 1;
  911. }