inffast.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340
  1. /* inffast.c -- fast decoding
  2. * Copyright (C) 1995-2008, 2010 Mark Adler
  3. * For conditions of distribution and use, see copyright notice in zlib.h
  4. */
  5. #include "zutil.h"
  6. #include "inftrees.h"
  7. #include "inflate.h"
  8. #include "inffast.h"
  9. #ifndef ASMINF
  10. /* Allow machine dependent optimization for post-increment or pre-increment.
  11. Based on testing to date,
  12. Pre-increment preferred for:
  13. - PowerPC G3 (Adler)
  14. - MIPS R5000 (Randers-Pehrson)
  15. Post-increment preferred for:
  16. - none
  17. No measurable difference:
  18. - Pentium III (Anderson)
  19. - M68060 (Nikl)
  20. */
  21. #ifdef POSTINC
  22. # define OFF 0
  23. # define PUP(a) *(a)++
  24. #else
  25. # define OFF 1
  26. # define PUP(a) *++(a)
  27. #endif
  28. /*
  29. Decode literal, length, and distance codes and write out the resulting
  30. literal and match bytes until either not enough input or output is
  31. available, an end-of-block is encountered, or a data error is encountered.
  32. When large enough input and output buffers are supplied to inflate(), for
  33. example, a 16K input buffer and a 64K output buffer, more than 95% of the
  34. inflate execution time is spent in this routine.
  35. Entry assumptions:
  36. state->mode == LEN
  37. strm->avail_in >= 6
  38. strm->avail_out >= 258
  39. start >= strm->avail_out
  40. state->bits < 8
  41. On return, state->mode is one of:
  42. LEN -- ran out of enough output space or enough available input
  43. TYPE -- reached end of block code, inflate() to interpret next block
  44. BAD -- error in block data
  45. Notes:
  46. - The maximum input bits used by a length/distance pair is 15 bits for the
  47. length code, 5 bits for the length extra, 15 bits for the distance code,
  48. and 13 bits for the distance extra. This totals 48 bits, or six bytes.
  49. Therefore if strm->avail_in >= 6, then there is enough input to avoid
  50. checking for available input while decoding.
  51. - The maximum bytes that a single length/distance pair can output is 258
  52. bytes, which is the maximum length that can be coded. inflate_fast()
  53. requires strm->avail_out >= 258 for each loop to avoid checking for
  54. output space.
  55. */
  56. void ZLIB_INTERNAL inflate_fast(strm, start)
  57. z_streamp strm;
  58. unsigned start; /* inflate()'s starting value for strm->avail_out */
  59. {
  60. struct inflate_state FAR *state;
  61. unsigned char FAR *in; /* local strm->next_in */
  62. unsigned char FAR *last; /* while in < last, enough input available */
  63. unsigned char FAR *out; /* local strm->next_out */
  64. unsigned char FAR *beg; /* inflate()'s initial strm->next_out */
  65. unsigned char FAR *end; /* while out < end, enough space available */
  66. #ifdef INFLATE_STRICT
  67. unsigned dmax; /* maximum distance from zlib header */
  68. #endif
  69. unsigned wsize; /* window size or zero if not using window */
  70. unsigned whave; /* valid bytes in the window */
  71. unsigned wnext; /* window write index */
  72. unsigned char FAR *window; /* allocated sliding window, if wsize != 0 */
  73. unsigned long hold; /* local strm->hold */
  74. unsigned bits; /* local strm->bits */
  75. code const FAR *lcode; /* local strm->lencode */
  76. code const FAR *dcode; /* local strm->distcode */
  77. unsigned lmask; /* mask for first level of length codes */
  78. unsigned dmask; /* mask for first level of distance codes */
  79. code here; /* retrieved table entry */
  80. unsigned op; /* code bits, operation, extra bits, or */
  81. /* window position, window bytes to copy */
  82. unsigned len; /* match length, unused bytes */
  83. unsigned dist; /* match distance */
  84. unsigned char FAR *from; /* where to copy match from */
  85. /* copy state to local variables */
  86. state = (struct inflate_state FAR *)strm->state;
  87. in = strm->next_in - OFF;
  88. last = in + (strm->avail_in - 5);
  89. out = strm->next_out - OFF;
  90. beg = out - (start - strm->avail_out);
  91. end = out + (strm->avail_out - 257);
  92. #ifdef INFLATE_STRICT
  93. dmax = state->dmax;
  94. #endif
  95. wsize = state->wsize;
  96. whave = state->whave;
  97. wnext = state->wnext;
  98. window = state->window;
  99. hold = state->hold;
  100. bits = state->bits;
  101. lcode = state->lencode;
  102. dcode = state->distcode;
  103. lmask = (1U << state->lenbits) - 1;
  104. dmask = (1U << state->distbits) - 1;
  105. /* decode literals and length/distances until end-of-block or not enough
  106. input data or output space */
  107. do {
  108. if (bits < 15) {
  109. hold += (unsigned long)(PUP(in)) << bits;
  110. bits += 8;
  111. hold += (unsigned long)(PUP(in)) << bits;
  112. bits += 8;
  113. }
  114. here = lcode[hold & lmask];
  115. dolen:
  116. op = (unsigned)(here.bits);
  117. hold >>= op;
  118. bits -= op;
  119. op = (unsigned)(here.op);
  120. if (op == 0) { /* literal */
  121. Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?
  122. "inflate: literal '%c'\n" :
  123. "inflate: literal 0x%02x\n", here.val));
  124. PUP(out) = (unsigned char)(here.val);
  125. }
  126. else if (op & 16) { /* length base */
  127. len = (unsigned)(here.val);
  128. op &= 15; /* number of extra bits */
  129. if (op) {
  130. if (bits < op) {
  131. hold += (unsigned long)(PUP(in)) << bits;
  132. bits += 8;
  133. }
  134. len += (unsigned)hold & ((1U << op) - 1);
  135. hold >>= op;
  136. bits -= op;
  137. }
  138. Tracevv((stderr, "inflate: length %u\n", len));
  139. if (bits < 15) {
  140. hold += (unsigned long)(PUP(in)) << bits;
  141. bits += 8;
  142. hold += (unsigned long)(PUP(in)) << bits;
  143. bits += 8;
  144. }
  145. here = dcode[hold & dmask];
  146. dodist:
  147. op = (unsigned)(here.bits);
  148. hold >>= op;
  149. bits -= op;
  150. op = (unsigned)(here.op);
  151. if (op & 16) { /* distance base */
  152. dist = (unsigned)(here.val);
  153. op &= 15; /* number of extra bits */
  154. if (bits < op) {
  155. hold += (unsigned long)(PUP(in)) << bits;
  156. bits += 8;
  157. if (bits < op) {
  158. hold += (unsigned long)(PUP(in)) << bits;
  159. bits += 8;
  160. }
  161. }
  162. dist += (unsigned)hold & ((1U << op) - 1);
  163. #ifdef INFLATE_STRICT
  164. if (dist > dmax) {
  165. strm->msg = (char *)"invalid distance too far back";
  166. state->mode = BAD;
  167. break;
  168. }
  169. #endif
  170. hold >>= op;
  171. bits -= op;
  172. Tracevv((stderr, "inflate: distance %u\n", dist));
  173. op = (unsigned)(out - beg); /* max distance in output */
  174. if (dist > op) { /* see if copy from window */
  175. op = dist - op; /* distance back in window */
  176. if (op > whave) {
  177. if (state->sane) {
  178. strm->msg =
  179. (char *)"invalid distance too far back";
  180. state->mode = BAD;
  181. break;
  182. }
  183. #ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR
  184. if (len <= op - whave) {
  185. do {
  186. PUP(out) = 0;
  187. } while (--len);
  188. continue;
  189. }
  190. len -= op - whave;
  191. do {
  192. PUP(out) = 0;
  193. } while (--op > whave);
  194. if (op == 0) {
  195. from = out - dist;
  196. do {
  197. PUP(out) = PUP(from);
  198. } while (--len);
  199. continue;
  200. }
  201. #endif
  202. }
  203. from = window - OFF;
  204. if (wnext == 0) { /* very common case */
  205. from += wsize - op;
  206. if (op < len) { /* some from window */
  207. len -= op;
  208. do {
  209. PUP(out) = PUP(from);
  210. } while (--op);
  211. from = out - dist; /* rest from output */
  212. }
  213. }
  214. else if (wnext < op) { /* wrap around window */
  215. from += wsize + wnext - op;
  216. op -= wnext;
  217. if (op < len) { /* some from end of window */
  218. len -= op;
  219. do {
  220. PUP(out) = PUP(from);
  221. } while (--op);
  222. from = window - OFF;
  223. if (wnext < len) { /* some from start of window */
  224. op = wnext;
  225. len -= op;
  226. do {
  227. PUP(out) = PUP(from);
  228. } while (--op);
  229. from = out - dist; /* rest from output */
  230. }
  231. }
  232. }
  233. else { /* contiguous in window */
  234. from += wnext - op;
  235. if (op < len) { /* some from window */
  236. len -= op;
  237. do {
  238. PUP(out) = PUP(from);
  239. } while (--op);
  240. from = out - dist; /* rest from output */
  241. }
  242. }
  243. while (len > 2) {
  244. PUP(out) = PUP(from);
  245. PUP(out) = PUP(from);
  246. PUP(out) = PUP(from);
  247. len -= 3;
  248. }
  249. if (len) {
  250. PUP(out) = PUP(from);
  251. if (len > 1)
  252. PUP(out) = PUP(from);
  253. }
  254. }
  255. else {
  256. from = out - dist; /* copy direct from output */
  257. do { /* minimum length is three */
  258. PUP(out) = PUP(from);
  259. PUP(out) = PUP(from);
  260. PUP(out) = PUP(from);
  261. len -= 3;
  262. } while (len > 2);
  263. if (len) {
  264. PUP(out) = PUP(from);
  265. if (len > 1)
  266. PUP(out) = PUP(from);
  267. }
  268. }
  269. }
  270. else if ((op & 64) == 0) { /* 2nd level distance code */
  271. here = dcode[here.val + (hold & ((1U << op) - 1))];
  272. goto dodist;
  273. }
  274. else {
  275. strm->msg = (char *)"invalid distance code";
  276. state->mode = BAD;
  277. break;
  278. }
  279. }
  280. else if ((op & 64) == 0) { /* 2nd level length code */
  281. here = lcode[here.val + (hold & ((1U << op) - 1))];
  282. goto dolen;
  283. }
  284. else if (op & 32) { /* end-of-block */
  285. Tracevv((stderr, "inflate: end of block\n"));
  286. state->mode = TYPE;
  287. break;
  288. }
  289. else {
  290. strm->msg = (char *)"invalid literal/length code";
  291. state->mode = BAD;
  292. break;
  293. }
  294. } while (in < last && out < end);
  295. /* return unused bytes (on entry, bits < 8, so in won't go too far back) */
  296. len = bits >> 3;
  297. in -= len;
  298. bits -= len << 3;
  299. hold &= (1U << bits) - 1;
  300. /* update state and return */
  301. strm->next_in = in + OFF;
  302. strm->next_out = out + OFF;
  303. strm->avail_in = (unsigned)(in < last ? 5 + (last - in) : 5 - (in - last));
  304. strm->avail_out = (unsigned)(out < end ?
  305. 257 + (end - out) : 257 - (out - end));
  306. state->hold = hold;
  307. state->bits = bits;
  308. return;
  309. }
  310. /*
  311. inflate_fast() speedups that turned out slower (on a PowerPC G3 750CXe):
  312. - Using bit fields for code structure
  313. - Different op definition to avoid & for extra bits (do & for table bits)
  314. - Three separate decoding do-loops for direct, window, and wnext == 0
  315. - Special case for distance > 1 copies to do overlapped load and store copy
  316. - Explicit branch predictions (based on measured branch probabilities)
  317. - Deferring match copy and interspersed it with decoding subsequent codes
  318. - Swapping literal/length else
  319. - Swapping window/direct else
  320. - Larger unrolled copy loops (three is about right)
  321. - Moving len -= 3 statement into middle of loop
  322. */
  323. #endif /* !ASMINF */