compression.c 27 KB

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