bzip2.c 5.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206
  1. /*
  2. * Copyright (C) 2007 Denys Vlasenko <vda.linux@googlemail.com>
  3. *
  4. * This file uses bzip2 library code which is written
  5. * by Julian Seward <jseward@bzip.org>.
  6. * See README and LICENSE files in bz/ directory for more information
  7. * about bzip2 library code.
  8. */
  9. //config:config BZIP2
  10. //config: bool "bzip2"
  11. //config: default y
  12. //config: help
  13. //config: bzip2 is a compression utility using the Burrows-Wheeler block
  14. //config: sorting text compression algorithm, and Huffman coding. Compression
  15. //config: is generally considerably better than that achieved by more
  16. //config: conventional LZ77/LZ78-based compressors, and approaches the
  17. //config: performance of the PPM family of statistical compressors.
  18. //config:
  19. //config: Unless you have a specific application which requires bzip2, you
  20. //config: should probably say N here.
  21. //applet:IF_BZIP2(APPLET(bzip2, BB_DIR_USR_BIN, BB_SUID_DROP))
  22. //kbuild:lib-$(CONFIG_BZIP2) += bzip2.o
  23. //usage:#define bzip2_trivial_usage
  24. //usage: "[OPTIONS] [FILE]..."
  25. //usage:#define bzip2_full_usage "\n\n"
  26. //usage: "Compress FILEs (or stdin) with bzip2 algorithm\n"
  27. //usage: "\n -1..9 Compression level"
  28. //usage: "\n -d Decompress"
  29. //usage: "\n -c Write to stdout"
  30. //usage: "\n -f Force"
  31. #include "libbb.h"
  32. #include "bb_archive.h"
  33. #define CONFIG_BZIP2_FAST 1
  34. /* Speed test:
  35. * Compiled with gcc 4.2.1, run on Athlon 64 1800 MHz (512K L2 cache).
  36. * Stock bzip2 is 26.4% slower than bbox bzip2 at SPEED 1
  37. * (time to compress gcc-4.2.1.tar is 126.4% compared to bbox).
  38. * At SPEED 5 difference is 32.7%.
  39. *
  40. * Test run of all CONFIG_BZIP2_FAST values on a 11Mb text file:
  41. * Size Time (3 runs)
  42. * 0: 10828 4.145 4.146 4.148
  43. * 1: 11097 3.845 3.860 3.861
  44. * 2: 11392 3.763 3.767 3.768
  45. * 3: 11892 3.722 3.724 3.727
  46. * 4: 12740 3.637 3.640 3.644
  47. * 5: 17273 3.497 3.509 3.509
  48. */
  49. #define BZ_DEBUG 0
  50. /* Takes ~300 bytes, detects corruption caused by bad RAM etc */
  51. #define BZ_LIGHT_DEBUG 0
  52. #include "libarchive/bz/bzlib.h"
  53. #include "libarchive/bz/bzlib_private.h"
  54. #include "libarchive/bz/blocksort.c"
  55. #include "libarchive/bz/bzlib.c"
  56. #include "libarchive/bz/compress.c"
  57. #include "libarchive/bz/huffman.c"
  58. /* No point in being shy and having very small buffer here.
  59. * bzip2 internal buffers are much bigger anyway, hundreds of kbytes.
  60. * If iobuf is several pages long, malloc() may use mmap,
  61. * making iobuf is page aligned and thus (maybe) have one memcpy less
  62. * if kernel is clever enough.
  63. */
  64. enum {
  65. IOBUF_SIZE = 8 * 1024
  66. };
  67. static uint8_t level;
  68. /* NB: compressStream() has to return -1 on errors, not die.
  69. * bbunpack() will correctly clean up in this case
  70. * (delete incomplete .bz2 file)
  71. */
  72. /* Returns:
  73. * -1 on errors
  74. * total written bytes so far otherwise
  75. */
  76. static
  77. IF_DESKTOP(long long) int bz_write(bz_stream *strm, void* rbuf, ssize_t rlen, void *wbuf)
  78. {
  79. int n, n2, ret;
  80. strm->avail_in = rlen;
  81. strm->next_in = rbuf;
  82. while (1) {
  83. strm->avail_out = IOBUF_SIZE;
  84. strm->next_out = wbuf;
  85. ret = BZ2_bzCompress(strm, rlen ? BZ_RUN : BZ_FINISH);
  86. if (ret != BZ_RUN_OK /* BZ_RUNning */
  87. && ret != BZ_FINISH_OK /* BZ_FINISHing, but not done yet */
  88. && ret != BZ_STREAM_END /* BZ_FINISHed */
  89. ) {
  90. bb_error_msg_and_die("internal error %d", ret);
  91. }
  92. n = IOBUF_SIZE - strm->avail_out;
  93. if (n) {
  94. n2 = full_write(STDOUT_FILENO, wbuf, n);
  95. if (n2 != n) {
  96. if (n2 >= 0)
  97. errno = 0; /* prevent bogus error message */
  98. bb_perror_msg(n2 >= 0 ? "short write" : bb_msg_write_error);
  99. return -1;
  100. }
  101. }
  102. if (ret == BZ_STREAM_END)
  103. break;
  104. if (rlen && strm->avail_in == 0)
  105. break;
  106. }
  107. return 0 IF_DESKTOP( + strm->total_out );
  108. }
  109. static
  110. IF_DESKTOP(long long) int FAST_FUNC compressStream(transformer_aux_data_t *aux UNUSED_PARAM)
  111. {
  112. IF_DESKTOP(long long) int total;
  113. ssize_t count;
  114. bz_stream bzs; /* it's small */
  115. #define strm (&bzs)
  116. char *iobuf;
  117. #define rbuf iobuf
  118. #define wbuf (iobuf + IOBUF_SIZE)
  119. iobuf = xmalloc(2 * IOBUF_SIZE);
  120. BZ2_bzCompressInit(strm, level);
  121. while (1) {
  122. count = full_read(STDIN_FILENO, rbuf, IOBUF_SIZE);
  123. if (count < 0) {
  124. bb_perror_msg(bb_msg_read_error);
  125. total = -1;
  126. break;
  127. }
  128. /* if count == 0, bz_write finalizes compression */
  129. total = bz_write(strm, rbuf, count, wbuf);
  130. if (count == 0 || total < 0)
  131. break;
  132. }
  133. /* Can't be conditional on ENABLE_FEATURE_CLEAN_UP -
  134. * we are called repeatedly
  135. */
  136. BZ2_bzCompressEnd(strm);
  137. free(iobuf);
  138. return total;
  139. }
  140. int bzip2_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
  141. int bzip2_main(int argc UNUSED_PARAM, char **argv)
  142. {
  143. unsigned opt;
  144. /* standard bzip2 flags
  145. * -d --decompress force decompression
  146. * -z --compress force compression
  147. * -k --keep keep (don't delete) input files
  148. * -f --force overwrite existing output files
  149. * -t --test test compressed file integrity
  150. * -c --stdout output to standard out
  151. * -q --quiet suppress noncritical error messages
  152. * -v --verbose be verbose (a 2nd -v gives more)
  153. * -s --small use less memory (at most 2500k)
  154. * -1 .. -9 set block size to 100k .. 900k
  155. * --fast alias for -1
  156. * --best alias for -9
  157. */
  158. opt_complementary = "s2"; /* -s means -2 (compatibility) */
  159. /* Must match bbunzip's constants OPT_STDOUT, OPT_FORCE! */
  160. opt = getopt32(argv, "cfv" IF_BUNZIP2("dt") "123456789qzs");
  161. #if ENABLE_BUNZIP2 /* bunzip2_main may not be visible... */
  162. if (opt & 0x18) // -d and/or -t
  163. return bunzip2_main(argc, argv);
  164. opt >>= 5;
  165. #else
  166. opt >>= 3;
  167. #endif
  168. opt = (uint8_t)opt; /* isolate bits for -1..-8 */
  169. opt |= 0x100; /* if nothing else, assume -9 */
  170. level = 1;
  171. while (!(opt & 1)) {
  172. level++;
  173. opt >>= 1;
  174. }
  175. argv += optind;
  176. option_mask32 &= 0x7; /* ignore all except -cfv */
  177. return bbunpack(argv, compressStream, append_ext, "bz2");
  178. }