1050342.diff 3.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122
  1. Bug 1050342. Fix a case where the fast huffman decoder in libjpeg-turbo can produce different results depending on how data is fed to it.
  2. This change comes from the blink repo https://codereview.appspot.com/229430043/ and is unlikely to be accepted upstream into libjpeg-turbo.
  3. diff --git jdhuff.c jdhuff.c
  4. --- jdhuff.c
  5. +++ jdhuff.c
  6. @@ -664,17 +664,17 @@ decode_mcu_fast (j_decompress_ptr cinfo,
  7. ASSIGN_STATE(state, entropy->saved);
  8. for (blkn = 0; blkn < cinfo->blocks_in_MCU; blkn++) {
  9. JBLOCKROW block = MCU_data ? MCU_data[blkn] : NULL;
  10. d_derived_tbl *dctbl = entropy->dc_cur_tbls[blkn];
  11. d_derived_tbl *actbl = entropy->ac_cur_tbls[blkn];
  12. register int s, k, r, l;
  13. - HUFF_DECODE_FAST(s, l, dctbl);
  14. + HUFF_DECODE_FAST(s, l, dctbl, slow_decode_mcu);
  15. if (s) {
  16. FILL_BIT_BUFFER_FAST
  17. r = GET_BITS(s);
  18. s = HUFF_EXTEND(r, s);
  19. }
  20. if (entropy->dc_needed[blkn]) {
  21. int ci = cinfo->MCU_membership[blkn];
  22. @@ -682,17 +682,17 @@ decode_mcu_fast (j_decompress_ptr cinfo,
  23. state.last_dc_val[ci] = s;
  24. if (block)
  25. (*block)[0] = (JCOEF) s;
  26. }
  27. if (entropy->ac_needed[blkn] && block) {
  28. for (k = 1; k < DCTSIZE2; k++) {
  29. - HUFF_DECODE_FAST(s, l, actbl);
  30. + HUFF_DECODE_FAST(s, l, actbl, slow_decode_mcu);
  31. r = s >> 4;
  32. s &= 15;
  33. if (s) {
  34. k += r;
  35. FILL_BIT_BUFFER_FAST
  36. r = GET_BITS(s);
  37. s = HUFF_EXTEND(r, s);
  38. @@ -701,33 +701,34 @@ decode_mcu_fast (j_decompress_ptr cinfo,
  39. if (r != 15) break;
  40. k += 15;
  41. }
  42. }
  43. } else {
  44. for (k = 1; k < DCTSIZE2; k++) {
  45. - HUFF_DECODE_FAST(s, l, actbl);
  46. + HUFF_DECODE_FAST(s, l, actbl, slow_decode_mcu);
  47. r = s >> 4;
  48. s &= 15;
  49. if (s) {
  50. k += r;
  51. FILL_BIT_BUFFER_FAST
  52. DROP_BITS(s);
  53. } else {
  54. if (r != 15) break;
  55. k += 15;
  56. }
  57. }
  58. }
  59. }
  60. if (cinfo->unread_marker != 0) {
  61. +slow_decode_mcu:
  62. cinfo->unread_marker = 0;
  63. return FALSE;
  64. }
  65. br_state.bytes_in_buffer -= (buffer - br_state.next_input_byte);
  66. br_state.next_input_byte = buffer;
  67. BITREAD_SAVE_STATE(cinfo,entropy->bitstate);
  68. ASSIGN_STATE(entropy->saved, state);
  69. diff --git jdhuff.h jdhuff.h
  70. --- jdhuff.h
  71. +++ jdhuff.h
  72. @@ -203,32 +203,34 @@ EXTERN(boolean) jpeg_fill_bit_buffer
  73. } else { \
  74. slowlabel: \
  75. if ((result=jpeg_huff_decode(&state,get_buffer,bits_left,htbl,nb)) < 0) \
  76. { failaction; } \
  77. get_buffer = state.get_buffer; bits_left = state.bits_left; \
  78. } \
  79. }
  80. -#define HUFF_DECODE_FAST(s,nb,htbl) \
  81. +#define HUFF_DECODE_FAST(s,nb,htbl,slowlabel) \
  82. FILL_BIT_BUFFER_FAST; \
  83. s = PEEK_BITS(HUFF_LOOKAHEAD); \
  84. s = htbl->lookup[s]; \
  85. nb = s >> HUFF_LOOKAHEAD; \
  86. /* Pre-execute the common case of nb <= HUFF_LOOKAHEAD */ \
  87. DROP_BITS(nb); \
  88. s = s & ((1 << HUFF_LOOKAHEAD) - 1); \
  89. if (nb > HUFF_LOOKAHEAD) { \
  90. /* Equivalent of jpeg_huff_decode() */ \
  91. /* Don't use GET_BITS() here because we don't want to modify bits_left */ \
  92. s = (get_buffer >> bits_left) & ((1 << (nb)) - 1); \
  93. while (s > htbl->maxcode[nb]) { \
  94. s <<= 1; \
  95. s |= GET_BITS(1); \
  96. nb++; \
  97. } \
  98. - s = htbl->pub->huffval[ (int) (s + htbl->valoffset[nb]) & 0xFF ]; \
  99. + if (nb > 16) \
  100. + goto slowlabel; \
  101. + s = htbl->pub->huffval[ (int) (s + htbl->valoffset[nb]) ]; \
  102. }
  103. /* Out-of-line case for Huffman code fetching */
  104. EXTERN(int) jpeg_huff_decode
  105. (bitread_working_state *state, register bit_buf_type get_buffer,
  106. register int bits_left, d_derived_tbl *htbl, int min_bits);