bitreader.c 3.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104
  1. /*
  2. * Copyright (c) 2010 The WebM project authors. All Rights Reserved.
  3. *
  4. * Use of this source code is governed by a BSD-style license
  5. * that can be found in the LICENSE file in the root of the source
  6. * tree. An additional intellectual property rights grant can be found
  7. * in the file PATENTS. All contributing project authors may
  8. * be found in the AUTHORS file in the root of the source tree.
  9. */
  10. #include <stdlib.h>
  11. #include "./vpx_config.h"
  12. #include "vpx_dsp/bitreader.h"
  13. #include "vpx_dsp/prob.h"
  14. #include "vpx_dsp/vpx_dsp_common.h"
  15. #include "vpx_ports/mem.h"
  16. #include "vpx_mem/vpx_mem.h"
  17. #include "vpx_util/endian_inl.h"
  18. int vpx_reader_init(vpx_reader *r,
  19. const uint8_t *buffer,
  20. size_t size,
  21. vpx_decrypt_cb decrypt_cb,
  22. void *decrypt_state) {
  23. if (size && !buffer) {
  24. return 1;
  25. } else {
  26. r->buffer_end = buffer + size;
  27. r->buffer = buffer;
  28. r->value = 0;
  29. r->count = -8;
  30. r->range = 255;
  31. r->decrypt_cb = decrypt_cb;
  32. r->decrypt_state = decrypt_state;
  33. vpx_reader_fill(r);
  34. return vpx_read_bit(r) != 0; // marker bit
  35. }
  36. }
  37. void vpx_reader_fill(vpx_reader *r) {
  38. const uint8_t *const buffer_end = r->buffer_end;
  39. const uint8_t *buffer = r->buffer;
  40. const uint8_t *buffer_start = buffer;
  41. BD_VALUE value = r->value;
  42. int count = r->count;
  43. const size_t bytes_left = buffer_end - buffer;
  44. const size_t bits_left = bytes_left * CHAR_BIT;
  45. int shift = BD_VALUE_SIZE - CHAR_BIT - (count + CHAR_BIT);
  46. if (r->decrypt_cb) {
  47. size_t n = VPXMIN(sizeof(r->clear_buffer), bytes_left);
  48. r->decrypt_cb(r->decrypt_state, buffer, r->clear_buffer, (int)n);
  49. buffer = r->clear_buffer;
  50. buffer_start = r->clear_buffer;
  51. }
  52. if (bits_left > BD_VALUE_SIZE) {
  53. const int bits = (shift & 0xfffffff8) + CHAR_BIT;
  54. BD_VALUE nv;
  55. BD_VALUE big_endian_values;
  56. memcpy(&big_endian_values, buffer, sizeof(BD_VALUE));
  57. #if SIZE_MAX == 0xffffffffffffffffULL
  58. big_endian_values = HToBE64(big_endian_values);
  59. #else
  60. big_endian_values = HToBE32(big_endian_values);
  61. #endif
  62. nv = big_endian_values >> (BD_VALUE_SIZE - bits);
  63. count += bits;
  64. buffer += (bits >> 3);
  65. value = r->value | (nv << (shift & 0x7));
  66. } else {
  67. const int bits_over = (int)(shift + CHAR_BIT - (int)bits_left);
  68. int loop_end = 0;
  69. if (bits_over >= 0) {
  70. count += LOTS_OF_BITS;
  71. loop_end = bits_over;
  72. }
  73. if (bits_over < 0 || bits_left) {
  74. while (shift >= loop_end) {
  75. count += CHAR_BIT;
  76. value |= (BD_VALUE)*buffer++ << shift;
  77. shift -= CHAR_BIT;
  78. }
  79. }
  80. }
  81. // NOTE: Variable 'buffer' may not relate to 'r->buffer' after decryption,
  82. // so we increase 'r->buffer' by the amount that 'buffer' moved, rather than
  83. // assign 'buffer' to 'r->buffer'.
  84. r->buffer += buffer - buffer_start;
  85. r->value = value;
  86. r->count = count;
  87. }
  88. const uint8_t *vpx_reader_find_end(vpx_reader *r) {
  89. // Find the end of the coded buffer
  90. while (r->count > CHAR_BIT && r->count < BD_VALUE_SIZE) {
  91. r->count -= CHAR_BIT;
  92. r->buffer--;
  93. }
  94. return r->buffer;
  95. }